From 3b32da01917a9ae34c8eee531eb29cad84513140 Mon Sep 17 00:00:00 2001
From: camperbot <camperbot@users.noreply.github.com>
Date: Fri, 16 Jul 2021 11:03:16 +0530
Subject: [PATCH] chore(i18n,curriculum): processed translations (#42868)

---
 .../create-decimal-numbers-with-javascript.md |   2 +-
 .../use-body-parser-to-parse-post-requests.md |   8 +-
 .../data-analysis-example-a.md                |  20 +-
 .../data-analysis-example-b.md                |   2 +-
 .../data-cleaning-and-visualizations.md       |  18 +-
 .../data-cleaning-duplicates.md               |  18 +-
 .../data-cleaning-introduction.md             |   2 +-
 .../data-cleaning-with-dataframes.md          |  12 +-
 .../how-to-use-jupyter-notebooks-intro.md     |  17 +-
 .../introduction-to-data-analysis.md          |  17 +-
 .../jupyter-notebooks-cells.md                |  19 +-
 ...-notebooks-importing-and-exporting-data.md |  23 +-
 .../numpy-algebra-and-size.md                 |  20 +-
 .../numpy-arrays.md                           |  12 +-
 .../numpy-boolean-arrays.md                   |  12 +-
 .../numpy-introduction-a.md                   |  18 +-
 .../numpy-introduction-b.md                   |  20 +-
 .../numpy-operations.md                       |  12 +-
 ...onal-selection-and-modifying-dataframes.md |  12 +-
 .../pandas-creating-columns.md                |  12 +-
 .../pandas-dataframes.md                      |  10 +-
 ...ndas-indexing-and-conditional-selection.md |  12 +-
 .../pandas-introduction.md                    |  12 +-
 .../parsing-html-and-saving-data.md           |  12 +-
 .../python-functions-and-collections.md       |  18 +-
 .../python-introduction.md                    |  20 +-
 .../python-iteration-and-modules.md           |  12 +-
 .../reading-data-csv-and-txt.md               |  12 +-
 .../reading-data-from-databases.md            |  18 +-
 .../reading-data-introduction.md              |  14 +-
 .../demographic-data-analyzer.md              |  13 +-
 .../medical-data-visualizer.md                |  13 +-
 .../page-view-time-series-visualizer.md       |  13 +-
 .../sea-level-predictor.md                    |  13 +-
 ...ng-and-changing-elements,-rows,-columns.md |   4 +-
 .../numpy/basics-of-numpy.md                  |   4 +-
 .../numpy/copying-arrays-warning.md           |   4 +-
 .../numpy/initialize-array-problem.md         |   4 +-
 .../numpy/initializing-different-arrays.md    |   4 +-
 .../numpy/mathematics.md                      |   4 +-
 .../numpy/reorganizing-arrays.md              |   4 +-
 .../anonymous-message-board.md                | 104 +++++---
 .../port-scanner.md                           |  17 +-
 .../secure-real-time-multiplayer-game.md      |  85 ++++---
 .../sha-1-password-cracker.md                 |  17 +-
 .../stock-price-checker.md                    |  50 ++--
 ...ur-site-via-https-only-with-helmet.hsts.md |  14 +-
 ...-response-mime-type-with-helmet.nosniff.md |   8 +-
 ...lmet-using-the-parent-helmet-middleware.md |  14 +-
 ...client-side-caching-with-helmet.nocache.md |  10 +-
 ...fetching-with-helmet.dnsprefetchcontrol.md |  10 +-
 ...sh-and-compare-passwords-asynchronously.md |  16 +-
 ...ash-and-compare-passwords-synchronously.md |  16 +-
 ...-information-using-helmet.hidepoweredby.md |   8 +-
 .../install-and-require-helmet.md             |  23 +-
 ...-of-clickjacking-with-helmet.frameguard.md |  14 +-
 ...pting-xss-attacks-with-helmet.xssfilter.md |  16 +-
 ...ing-untrusted-html-with-helmet.ienoopen.md |  10 +-
 ...olicy-with-helmet.contentsecuritypolicy.md |  16 +-
 .../understand-bcrypt-hashes.md               |  18 +-
 .../creating-a-tcp-client.md                  |   4 +-
 .../developing-a-banner-grabber.md            |   4 +-
 .../developing-a-port-scanner.md              |  10 +-
 .../developing-an-nmap-scanner-part-1.md      |   4 +-
 .../developing-an-nmap-scanner-part-2.md      |   4 +-
 .../introduction-and-setup.md                 |  10 +-
 .../data-structures/create-a-hash-table.md    |  66 +++--
 .../create-a-priority-queue-class.md          |   8 +-
 .../data-structures/create-a-stack-class.md   |   7 +-
 .../create-an-es6-javascript-map.md           |   2 +
 .../create-and-add-to-sets-in-es6.md          |  12 +-
 .../insert-an-element-into-a-max-heap.md      |   8 +-
 .../remove-items-from-a-set-in-es6.md         |  11 +-
 .../data-structures/typed-arrays.md           |   4 +-
 .../use-.has-and-.size-on-an-es6-set.md       |  12 +-
 .../problem-100-arranged-probability.md       |  59 ++++-
 .../problem-101-optimum-polynomial.md         |  22 +-
 .../problem-102-triangle-containment.md       | 130 +++++++++-
 ...problem-103-special-subset-sums-optimum.md |  27 +-
 .../problem-104-pandigital-fibonacci-ends.md  |  14 +-
 ...problem-105-special-subset-sums-testing.md |  33 ++-
 ...em-106-special-subset-sums-meta-testing.md |  17 +-
 .../problem-107-minimal-network.md            |  41 +++-
 .../problem-108-diophantine-reciprocals-i.md  |   8 +-
 .../project-euler/problem-109-darts.md        |  24 +-
 .../problem-110-diophantine-reciprocals-ii.md |   6 +-
 .../problem-111-primes-with-runs.md           |  29 ++-
 .../problem-112-bouncy-numbers.md             |   8 +-
 .../problem-113-non-bouncy-numbers.md         |  12 +-
 ...oblem-114-counting-block-combinations-i.md |  14 +-
 ...blem-115-counting-block-combinations-ii.md |  22 +-
 .../problem-116-red-green-or-blue-tiles.md    |  18 +-
 .../problem-117-red-green-and-blue-tiles.md   |  14 +-
 .../problem-118-pandigital-prime-sets.md      |  10 +-
 .../problem-119-digit-power-sum.md            |  16 +-
 .../problem-120-square-remainders.md          |  14 +-
 .../problem-182-rsa-encryption.md             |  74 +++++-
 .../problem-32-pandigital-products.md         |  70 ++++--
 .../project-euler/problem-349-langtons-ant.md |   2 +-
 .../problem-38-pandigital-multiples.md        |  57 +++--
 .../problem-43-sub-string-divisibility.md     | 115 ++++++---
 .../project-euler/problem-461-almost-pi.md    | 133 ++++++++--
 .../problem-51-prime-digit-replacements.md    |  93 ++++++-
 .../problem-52-permuted-multiples.md          |  26 +-
 .../problem-56-powerful-digit-sum.md          |  73 +++++-
 .../problem-57-square-root-convergents.md     |  54 +++-
 .../project-euler/problem-58-spiral-primes.md |  63 ++++-
 .../problem-61-cyclical-figurate-numbers.md   | 231 ++++++++++++++++--
 .../problem-62-cubic-permutations.md          |  69 +++++-
 .../problem-63-powerful-digit-counts.md       |  92 ++++++-
 .../problem-64-odd-period-square-roots.md     |  64 ++++-
 .../problem-65-convergents-of-e.md            |  71 +++++-
 .../problem-66-diophantine-equation.md        |  81 +++++-
 .../problem-67-maximum-path-sum-ii.md         |  32 ++-
 .../problem-69-totient-maximum.md             |  88 +++++--
 .../problem-70-totient-permutation.md         |  90 ++++++-
 .../problem-71-ordered-fractions.md           |  65 ++++-
 .../problem-72-counting-fractions.md          |  60 ++++-
 ...roblem-73-counting-fractions-in-a-range.md |  53 +++-
 .../problem-74-digit-factorial-chains.md      |  96 ++++++--
 ...lem-75-singular-integer-right-triangles.md |  76 +++++-
 .../problem-76-counting-summations.md         |  46 +++-
 .../problem-77-prime-summations.md            |  74 +++++-
 .../problem-78-coin-partitions.md             |  63 ++++-
 .../problem-79-passcode-derivation.md         |  79 +++++-
 ...roblem-80-square-root-digital-expansion.md |  79 +++++-
 .../problem-81-path-sum-two-ways.md           |  70 ++++--
 .../problem-82-path-sum-three-ways.md         |  78 ++++--
 .../problem-83-path-sum-four-ways.md          |  98 ++++++--
 .../project-euler/problem-84-monopoly-odds.md | 130 +++++++++-
 .../problem-85-counting-rectangles.md         |  77 +++++-
 .../project-euler/problem-86-cuboid-route.md  |  60 ++++-
 .../problem-87-prime-power-triples.md         |  98 +++++++-
 .../problem-88-product-sum-numbers.md         |  72 +++++-
 .../problem-89-roman-numerals.md              |  72 +++++-
 ...ight-triangles-with-integer-coordinates.md |  87 ++++++-
 .../problem-92-square-digit-chains.md         | 121 ++++++++-
 ...problem-94-almost-equilateral-triangles.md |  54 +++-
 .../problem-95-amicable-chains.md             |  90 ++++++-
 .../project-euler/problem-96-su-doku.md       | 129 ++++++++--
 .../problem-97-large-non-mersenne-prime.md    |  60 ++++-
 .../problem-98-anagramic-squares.md           | 173 ++++++++++++-
 .../problem-99-largest-exponential.md         |  55 +++--
 .../rosetta-code/100-doors.md                 |   4 +-
 ...ient-and-perfect-number-classifications.md |  34 +--
 .../rosetta-code/align-columns.md             |  89 ++++---
 .../rosetta-code/closest-pair-problem.md      | 105 ++++++--
 .../convert-seconds-to-compound-duration.md   |   2 +-
 .../rosetta-code/count-the-coins.md           |  27 +-
 .../rosetta-code/cut-a-rectangle.md           | 117 +++++----
 .../rosetta-code/date-format.md               |  18 +-
 .../rosetta-code/emirp-primes.md              |   2 +-
 .../execute-a-markov-algorithm.md             |  40 +--
 .../factors-of-a-mersenne-number.md           |   8 +-
 .../rosetta-code/hailstone-sequence.md        |  66 +++--
 .../rosetta-code/happy-numbers.md             |  22 +-
 .../rosetta-code/harshad-or-niven-series.md   |  61 ++---
 .../rosetta-code/josephus-problem.md          |  57 ++---
 .../knapsack-problem-unbounded.md             |  88 ++++---
 .../rosetta-code/knights-tour.md              | 215 ++++++++++------
 .../rosetta-code/letter-frequency.md          |   8 +-
 ...oop-over-multiple-arrays-simultaneously.md |   8 +-
 .../rosetta-code/s-expressions.md             |   6 +-
 .../rosetta-code/sha-256.md                   |   4 +-
 .../rosetta-code/sort-disjoint-sublist.md     |   4 +-
 ...ter-string-based-on-change-of-character.md |   6 +-
 .../rosetta-code/sudoku.md                    |   2 +-
 .../rosetta-code/sum-of-a-series.md           |   2 +-
 .../rosetta-code/sum-to-100.md                |  10 -
 .../rosetta-code/top-rank-per-group.md        |  60 +++--
 .../rosetta-code/topological-sort.md          |  65 +++--
 .../rosetta-code/vector-cross-product.md      |   6 +-
 .../zeckendorf-number-representation.md       | 153 ++++++++++--
 .../zhang-suen-thinning-algorithm.md          | 185 +++++++-------
 .../build-a-pinterest-clone.md                |   2 +-
 .../take-home-projects/build-a-simon-game.md  |   2 +-
 .../manage-a-book-trading-club.md             |   2 +-
 .../p2p-video-chat-application.md             |   2 +-
 .../deep-learning-demystified.md              |  12 +-
 .../how-convolutional-neural-networks-work.md |  10 +-
 .../how-deep-neural-networks-work.md          |  10 +-
 ...rks-rnn-and-long-short-term-memory-lstm.md |  10 +-
 .../book-recommendation-engine-using-knn.md   |  15 +-
 .../cat-and-dog-image-classifier.md           |  13 +-
 ...near-regression-health-costs-calculator.md |  15 +-
 .../neural-network-sms-text-classifier.md     |  13 +-
 .../rock-paper-scissors.md                    |  13 +-
 .../tensorflow/conclusion.md                  |  10 +-
 ...al-neural-networks-evaluating-the-model.md |  10 +-
 ...ral-networks-picking-a-pretrained-model.md |   4 +-
 ...neural-networks-the-convolutional-layer.md |  10 +-
 .../convolutional-neural-networks.md          |  10 +-
 ...-learning-algorithms-building-the-model.md |   4 +-
 ...core-learning-algorithms-classification.md |  10 +-
 .../core-learning-algorithms-clustering.md    |  14 +-
 ...earning-algorithms-hidden-markov-models.md |  10 +-
 ...earning-algorithms-the-training-process.md |  10 +-
 ...ng-algorithms-training-and-testing-data.md |  10 +-
 ...using-probabilities-to-make-predictions.md |   4 +-
 ...e-learning-algorithms-working-with-data.md |  10 +-
 .../tensorflow/core-learning-algorithms.md    |  14 +-
 ...creating-a-convolutional-neural-network.md |   4 +-
 ...roduction-machine-learning-fundamentals.md |  10 +-
 .../tensorflow/introduction-to-tensorflow.md  |  12 +-
 ...processing-with-rnns-building-the-model.md |   4 +-
 ...ssing-with-rnns-create-a-play-generator.md |   6 +-
 ...processing-with-rnns-making-predictions.md |  10 +-
 ...al-language-processing-with-rnns-part-2.md |  10 +-
 ...ing-with-rnns-recurring-neural-networks.md |  12 +-
 ...ocessing-with-rnns-sentimental-analysis.md |   4 +-
 ...processing-with-rnns-training-the-model.md |   4 +-
 .../natural-language-processing-with-rnns.md  |  10 +-
 .../neural-networks-activation-functions.md   |   8 +-
 .../neural-networks-creating-a-model.md       |   4 +-
 .../tensorflow/neural-networks-optimizers.md  |  10 +-
 .../neural-networks-with-tensorflow.md        |  10 +-
 ...cement-learning-with-q-learning-example.md |   4 +-
 ...rcement-learning-with-q-learning-part-2.md |   8 +-
 .../reinforcement-learning-with-q-learning.md |  10 +-
 .../apis-and-microservices-certificate.yml    |  12 +-
 .../data-analysis-with-python-certificate.yml |  12 +-
 .../data-visualization-certificate.yml        |  12 +-
 .../front-end-libraries-certificate.yml       |  12 +-
 .../information-security-certificate.yml      |  12 +-
 ...rithms-and-data-structures-certificate.yml |  12 +-
 .../legacy-back-end-certificate.yml           |  22 +-
 .../legacy-data-visualization-certificate.yml |  22 +-
 .../legacy-front-end-certificate.yml          |  22 +-
 .../legacy-full-stack-certificate.yml         |  14 +-
 ...rity-and-quality-assurance-certificate.yml |  12 +-
 ...chine-learning-with-python-certificate.yml |  12 +-
 .../quality-assurance-certificate.yml         |  12 +-
 .../relational-databases-certificate.yml      |  21 ++
 ...ific-computing-with-python-certificate.yml |  12 +-
 .../celestial-bodies-database.md              |  18 ++
 .../learn-relational-databases/final-boss.md  |  18 ++
 .../learn-advanced-bash-by-building.md        |  18 ++
 ...-and-sql-by-building-a-bike-rental-shop.md |  17 ++
 .../learn-bash-by-building-a-boilerplate.md   |  18 ++
 ...ash-scripting-by-building-five-programs.md |  18 ++
 ...git-by-building-an-sql-reference-object.md |  18 ++
 ...building-a-list-of-inspirational-quotes.md |  18 ++
 .../learn-nano-by-building-a-castle.md        |  18 ++
 ...-databases-by-building-a-mario-database.md |  18 ++
 ...earn-sql-by-building-a-student-database.md |  18 ++
 .../periodic-table-database.md                |  18 ++
 .../salon-appointment-scheduler.md            |  18 ++
 .../world-cup-database.md                     |  18 ++
 .../react/create-a-controlled-form.md         |   2 +-
 .../react/introducing-inline-styles.md        |   2 +-
 .../react/pass-a-callback-as-props.md         |   2 +-
 ...state-in-the-user-interface-another-way.md |   2 +-
 .../use-body-parser-to-parse-post-requests.md |   8 +-
 ...nt-the-serialization-of-a-passport-user.md |  16 +-
 ...ementation-of-social-authentication-iii.md |  12 +-
 .../serialization-of-a-user-object.md         |  20 +-
 ...ality-with-.deepequal-and-.notdeepequal.md |  14 +-
 .../compare-the-properties-of-two-elements.md |  16 +-
 ...sponse-using-chai-http-iii---put-method.md |  28 +--
 ...ional-tests-using-a-headless-browser-ii.md |  32 +--
 .../test-if-a-value-is-an-array.md            |  12 +-
 .../test-if-an-object-has-a-property.md       |  16 +-
 ...-object-is-an-instance-of-a-constructor.md |  18 +-
 .../use-assert.isok-and-assert.isnotok.md     |  18 +-
 ...se-regular-expressions-to-test-a-string.md |  14 +-
 .../american-british-translator.md            | 110 ++++-----
 ...f-an-array-using-concat-instead-of-push.md |  22 +-
 ...ramming-to-convert-strings-to-url-slugs.md |  28 +--
 ...de-effects-using-functional-programming.md |  22 +-
 ...ray-into-a-string-using-the-join-method.md |  22 +-
 ...bine-two-arrays-using-the-concat-method.md |  16 +-
 .../implement-map-on-a-prototype.md           |  14 +-
 ...lement-the-filter-method-on-a-prototype.md |  10 +-
 ...ion-to-currying-and-partial-application.md |  24 +-
 .../learn-about-functional-programming.md     |  20 +-
 ...avoid-external-dependence-in-a-function.md |  24 +-
 ...actor-global-variables-out-of-functions.md |  22 +-
 ...-an-array-using-slice-instead-of-splice.md |  20 +-
 ...ray-without-changing-the-original-array.md |  20 +-
 ...part-of-an-array-using-the-slice-method.md |  20 +-
 ...ay-alphabetically-using-the-sort-method.md |  22 +-
 ...ng-into-an-array-using-the-split-method.md |  20 +-
 ...tand-functional-programming-terminology.md |  28 +--
 ...nd-the-hazards-of-using-imperative-code.md |  24 +-
 ...er-or-reduce-to-solve-a-complex-problem.md |  20 +-
 ...ry-element-in-an-array-meets-a-criteria.md |  18 +-
 ...er-method-to-extract-data-from-an-array.md |  22 +-
 ...ap-method-to-extract-data-from-an-array.md |  28 +--
 .../use-the-reduce-method-to-analyze-data.md  |  30 +--
 ...ny-elements-in-an-array-meet-a-criteria.md |  18 +-
 .../arguments-optional.md                     |  24 +-
 .../binary-agents.md                          |  10 +-
 .../convert-html-entities.md                  |  18 +-
 .../diff-two-arrays.md                        |  36 +--
 .../dna-pairing.md                            |  18 +-
 .../drop-it.md                                |  18 +-
 .../everything-be-true.md                     |  28 +--
 .../make-a-person.md                          |  30 +--
 .../map-the-debris.md                         |  16 +-
 .../missing-letters.md                        |  16 +-
 .../pig-latin.md                              |  22 +-
 .../search-and-replace.md                     |  24 +-
 .../seek-and-destroy.md                       |  18 +-
 .../smallest-common-multiple.md               |  20 +-
 .../sorted-union.md                           |  16 +-
 .../spinal-tap-case.md                        |  14 +-
 .../steamroller.md                            |  14 +-
 .../sum-all-numbers-in-a-range.md             |  16 +-
 .../sum-all-odd-fibonacci-numbers.md          |  20 +-
 .../sum-all-primes.md                         |  12 +-
 .../wherefore-art-thou.md                     |  18 +-
 .../caesars-cipher.md                         |  18 +-
 .../cash-register.md                          |  30 +--
 .../palindrome-checker.md                     |  38 +--
 .../roman-numeral-converter.md                |  58 ++---
 .../telephone-number-validator.md             |  64 ++---
 .../add-methods-after-inheritance.md          |  28 +--
 .../change-the-prototype-to-a-new-object.md   |  18 +-
 .../create-a-basic-javascript-object.md       |  20 +-
 .../create-a-method-on-an-object.md           |  14 +-
 .../define-a-constructor-function.md          |  18 +-
 ...xtend-constructors-to-receive-arguments.md |  20 +-
 .../inherit-behaviors-from-a-supertype.md     |  26 +-
 .../iterate-over-all-properties.md            |  16 +-
 ...ode-more-reusable-with-the-this-keyword.md |  16 +-
 .../override-inherited-methods.md             |  24 +-
 ...or-property-when-changing-the-prototype.md |  12 +-
 ...reset-an-inherited-constructor-property.md |  18 +-
 ...-prototype-to-an-instance-of-the-parent.md |  14 +-
 .../understand-own-properties.md              |  16 +-
 .../understand-the-constructor-property.md    |  18 +-
 ...iately-invoked-function-expression-iife.md |  14 +-
 .../understand-the-prototype-chain.md         |  14 +-
 ...d-where-an-objects-prototype-comes-from.md |  12 +-
 .../use-a-constructor-to-create-objects.md    |  16 +-
 ...mmon-behavior-between-unrelated-objects.md |  22 +-
 .../use-an-iife-to-create-a-module.md         |  16 +-
 ...n-object-from-being-modified-externally.md |  18 +-
 ...n-to-access-the-properties-of-an-object.md |  12 +-
 ...inheritance-so-you-dont-repeat-yourself.md |  18 +-
 ...ype-properties-to-reduce-duplicate-code.md |  20 +-
 ...-an-objects-constructor-with-instanceof.md |  16 +-
 .../check-for-all-or-none.md                  |  20 +-
 .../check-for-mixed-grouping-of-characters.md |  26 +-
 .../regular-expressions/extract-matches.md    |  20 +-
 .../find-characters-with-lazy-matching.md     |  20 +-
 .../find-more-than-the-first-match.md         |  24 +-
 .../find-one-or-more-criminals-in-a-hunt.md   |  26 +-
 .../ignore-case-while-matching.md             |  30 +--
 ...ral-string-with-different-possibilities.md |  26 +-
 .../match-all-letters-and-numbers.md          |  24 +-
 .../match-all-non-numbers.md                  |  24 +-
 .../regular-expressions/match-all-numbers.md  |  24 +-
 .../match-anything-with-wildcard-period.md    |  30 +--
 .../match-beginning-string-patterns.md        |  18 +-
 ...characters-that-occur-one-or-more-times.md |  18 +-
 ...haracters-that-occur-zero-or-more-times.md |  22 +-
 .../match-ending-string-patterns.md           |  16 +-
 ...atch-everything-but-letters-and-numbers.md |  22 +-
 .../match-letters-of-the-alphabet.md          |  20 +-
 .../match-literal-strings.md                  |  20 +-
 .../match-non-whitespace-characters.md        |  20 +-
 ...tch-numbers-and-letters-of-the-alphabet.md |  16 +-
 ...e-character-with-multiple-possibilities.md |  24 +-
 .../match-single-characters-not-specified.md  |  16 +-
 .../regular-expressions/match-whitespace.md   |  20 +-
 .../positive-and-negative-lookahead.md        |  36 +--
 .../remove-whitespace-from-start-and-end.md   |  14 +-
 .../restrict-possible-usernames.md            |  42 ++--
 .../reuse-patterns-using-capture-groups.md    |  34 +--
 .../specify-exact-number-of-matches.md        |  24 +-
 ...pecify-only-the-lower-number-of-matches.md |  26 +-
 ...ecify-upper-and-lower-number-of-matches.md |  26 +-
 ...se-capture-groups-to-search-and-replace.md |  24 +-
 .../using-the-test-method.md                  |  16 +-
 ...dd-elements-within-your-bootstrap-wells.md |   6 +-
 ...ont-awesome-icons-to-all-of-our-buttons.md |  14 +-
 .../add-font-awesome-icons-to-our-buttons.md  |  22 +-
 ...add-id-attributes-to-bootstrap-elements.md |  16 +-
 ...pply-the-default-bootstrap-button-style.md |  10 +-
 ...call-out-optional-actions-with-btn-info.md |  16 +-
 .../bootstrap/center-text-with-bootstrap.md   |  10 +-
 ...create-a-block-element-bootstrap-button.md |  20 +-
 .../bootstrap/create-a-bootstrap-button.md    |  12 +-
 .../bootstrap/create-a-bootstrap-headline.md  |  20 +-
 .../bootstrap/create-a-bootstrap-row.md       |  14 +-
 ...a-class-to-target-with-jquery-selectors.md |   8 +-
 .../bootstrap/create-a-custom-heading.md      |  18 +-
 .../bootstrap/create-bootstrap-wells.md       |  12 +-
 .../ditch-custom-css-for-bootstrap.md         |  22 +-
 .../give-each-element-a-unique-id.md          |  20 +-
 ...-within-a-bootstrap-container-fluid-div.md |  12 +-
 .../bootstrap/label-bootstrap-buttons.md      |  18 +-
 .../bootstrap/label-bootstrap-wells.md        |  16 +-
 ...rm-elements-responsively-with-bootstrap.md |  16 +-
 .../make-images-mobile-responsive.md          |  18 +-
 .../responsively-style-checkboxes.md          |  12 +-
 .../responsively-style-radio-buttons.md       |  14 +-
 .../bootstrap/split-your-bootstrap-row.md     |  10 +-
 .../style-text-inputs-as-form-controls.md     |  16 +-
 ...aste-the-bootstrap-button-color-rainbow.md |  14 +-
 .../use-a-span-to-target-inline-elements.md   |  24 +-
 .../bootstrap/use-comments-to-clarify-code.md |  18 +-
 ...-design-with-bootstrap-fluid-containers.md |  20 +-
 ...strap-grid-to-put-elements-side-by-side.md |  22 +-
 ...s-of-a-dangerous-action-with-btn-danger.md |  16 +-
 .../build-a-25-5-clock.md                     |  68 +++---
 .../build-a-drum-machine.md                   |  26 +-
 .../build-a-javascript-calculator.md          |  50 ++--
 .../build-a-markdown-previewer.md             |  26 +-
 .../build-a-random-quote-machine.md           |  36 +--
 ...nge-text-inside-an-element-using-jquery.md |  26 +-
 ...ange-the-css-of-an-element-using-jquery.md |  18 +-
 .../jquery/clone-an-element-using-jquery.md   |  18 +-
 .../jquery/delete-your-jquery-functions.md    |  16 +-
 .../jquery/disable-an-element-using-jquery.md |  18 +-
 ...how-script-tags-and-document-ready-work.md |  22 +-
 .../jquery/remove-an-element-using-jquery.md  |  12 +-
 ...ove-classes-from-an-element-with-jquery.md |  14 +-
 ...ecific-child-of-an-element-using-jquery.md |  20 +-
 .../target-elements-by-class-using-jquery.md  |  18 +-
 .../target-elements-by-id-using-jquery.md     |  18 +-
 .../target-even-elements-using-jquery.md      |  16 +-
 ...ml-elements-with-selectors-using-jquery.md |  18 +-
 ...the-children-of-an-element-using-jquery.md |  16 +-
 ...t-the-parent-of-an-element-using-jquery.md |  20 +-
 ...-element-with-multiple-jquery-selectors.md |  28 +--
 ...e-appendto-to-move-elements-with-jquery.md |  16 +-
 .../use-jquery-to-modify-the-entire-page.md   |  12 +-
 429 files changed, 7502 insertions(+), 4006 deletions(-)
 create mode 100644 curriculum/challenges/chinese-traditional/12-certificates/relational-databases-certificate/relational-databases-certificate.yml
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/celestial-bodies-database.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/final-boss.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-advanced-bash-by-building.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-and-sql-by-building-a-bike-rental-shop.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-by-building-a-boilerplate.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-scripting-by-building-five-programs.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-git-by-building-an-sql-reference-object.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-github-by-building-a-list-of-inspirational-quotes.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-nano-by-building-a-castle.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-relational-databases-by-building-a-mario-database.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-sql-by-building-a-student-database.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/periodic-table-database.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/salon-appointment-scheduler.md
 create mode 100644 curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/world-cup-database.md

diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md
index 12401069db..df7e68bc57 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md
@@ -11,7 +11,7 @@ dashedName: create-decimal-numbers-with-javascript
 
 我們也可以把小數存儲到變量中。 小數有時候也被稱作<dfn>浮點數</dfn>或者 <dfn>floats</dfn>。
 
-**提示：** 不是所有的實數都可以用浮點數（<dfn>floating point</dfn>）來表示。 因爲可能產生四捨五入的錯誤， [查看詳情](https://en.wikipedia.org/wiki/Floating_point#Accuracy_problems)。
+**提示：** 不是所有的實數都可以用浮點數（<dfn>floating point</dfn>）來表示。 因爲可能產生四捨五入的錯誤， [點擊這裏瞭解細節](https://en.wikipedia.org/wiki/Floating-point_arithmetic#Accuracy_problems)。
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md b/curriculum/challenges/chinese-traditional/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md
index 8d95a92dbc..aa26cf4134 100644
--- a/curriculum/challenges/chinese-traditional/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md
+++ b/curriculum/challenges/chinese-traditional/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md
@@ -26,13 +26,15 @@ name=John+Doe&age=25
 
 # --instructions--
 
-在 `package.json` 中安裝 `body-parser` 模塊， 然後在文件頂部 `require` 進來， 用變量 `bodyParser` 保存它。 通過中間件的 `bodyParser.urlencoded({extended: false})` 方法處理 URL 編碼數據， 將調用上個方法返回的函數傳給 `app.use()`， 中間件通常掛載在所有需要它的路由之前。
+在 `package.json` 中安裝 `body-parser` 模塊， 然後在文件頂部 `require` 進來， 用變量 `bodyParser` 保存它。 通過中間件的 `bodyParser.urlencoded({extended: false})` 方法處理 URL 編碼數據， Pass the function returned by the previous method call to `app.use()`. As usual, the middleware must be mounted before all the routes that depend on it.
 
-**注意：**`extended=false` 是一個告訴解析器使用經典編碼的配置選項， 當使用它時，值只能是字符串或者數組， 拓展版本數據更加靈活，但稍遜於 JSON。
+**Note:** `extended` is a configuration option that tells `body-parser` which parsing needs to be used. When `extended=false` it uses the classic encoding `querystring` library. When `extended=true` it uses `qs` library for parsing.
+
+When using `extended=false`, values can be only strings or arrays. The object returned when using `querystring` does not prototypically inherit from the default JavaScript `Object`, which means functions like `hasOwnProperty`, `toString` will not be available. The extended version allows more data flexibility, but it is outmatched by JSON.
 
 # --hints--
 
-應該掛載“body-parser”中間件
+The 'body-parser' middleware should be mounted
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md
index 9a24560aa9..ef6dabf07f 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c14d
-title: Data Analysis Example A
+title: 數據分析 案例 A
 challengeType: 11
 videoId: nVAaxZ34khk
 dashedName: data-analysis-example-a
@@ -8,34 +8,34 @@ dashedName: data-analysis-example-a
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/FreeCodeCamp-Pandas-Real-Life-Example)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md
index 3c5b57866a..d8df41fe7e 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md
@@ -8,7 +8,7 @@ dashedName: data-analysis-example-b
 
 # --description--
 
-*您可以使用 Google Colab，而不是像視頻中顯示的那樣使用 notebooks.ai。*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
 更多資源：
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
index 13cd90fb08..67612d0ad2 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c160
-title: Data Cleaning and Visualizations
+title: 數據清理和可視化
 challengeType: 11
 videoId: mHjxzFS5_Z0
 dashedName: data-cleaning-and-visualizations
@@ -8,18 +8,18 @@ dashedName: data-cleaning-and-visualizations
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+當使用 Matplotlib 的全局 API 時，數字的順序在這裏意味着什麼？
 
 ```py
 plt.subplot(1, 2, 1)
@@ -27,15 +27,15 @@ 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--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md
index cf159cead1..1f264a2a91 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c15f
-title: Data Cleaning Duplicates
+title: 數據 清理重複項
 challengeType: 11
 videoId: kj7QqjXhH6A
 dashedName: data-cleaning-duplicates
@@ -8,30 +8,30 @@ dashedName: data-cleaning-duplicates
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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:
+Python 方法 `.duplicated()` 將針對你的 DataFrame 返回一個儲存着布爾值的 Series。 `True` 是行的返回值：
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md
index 496e66d910..2489fa2846 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md
@@ -8,7 +8,7 @@ dashedName: data-cleaning-introduction
 
 # --description--
 
-*您可以使用 Google Colab，而不是像視頻中顯示的那樣使用 notebooks.ai。*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
 以下有更多的資料：
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
index 887af41702..e812e9b46f 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c15e
-title: Data Cleaning with DataFrames
+title: DataFrames 中的數據清理
 challengeType: 11
 videoId: sTMN_pdI6S0
 dashedName: data-cleaning-with-dataframes
@@ -8,18 +8,18 @@ dashedName: data-cleaning-with-dataframes
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
index 4ac7363d87..17a7ce1cab 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c14f
-title: How to use Jupyter Notebooks Intro
+title: 如何使用 Jupyter Notebook
 challengeType: 11
 videoId: h8caJq2Bb9w
 dashedName: how-to-use-jupyter-notebooks-intro
@@ -8,19 +8,18 @@ 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.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
--   [Twitter Cheat Sheet](https://twitter.com/rmotr_com/status/1122176794696847361)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+以下哪個是 Jupyter Notebook 單元格中**不**允許的？
 
 ## --answers--
 
@@ -28,11 +27,11 @@ Markdown
 
 ---
 
-Python code
+Python 代碼
 
 ---
 
-An Excel sheet
+Excel 工作表
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
index a092ad93a8..f9bbcf469a 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c14c
-title: Introduction to Data Analysis
+title: 數據分析簡介
 challengeType: 11
 videoId: VJrP2FUzKP0
 dashedName: introduction-to-data-analysis
@@ -8,33 +8,32 @@ dashedName: introduction-to-data-analysis
 
 # --description--
 
-More resources:
+以下有更多的資料：
 
-\- [Slides](https://docs.google.com/presentation/d/1fDpjlyMiOMJyuc7_jMekcYLPP2XlSl1eWw9F7yE7byk)
+\- [幻燈片](https://docs.google.com/presentation/d/1cUIt8b2ySz-85_ykfeuuWsurccwTAuFPn782pZBzFsU/edit?usp=sharing)
 
 # --question--
 
 ## --text--
 
-Why should you choose R over Python for data analysis?
+以下哪一項 **不是** 數據分析的一部分？
 
 ## --answers--
 
-It's simple to learn.
+建立統計模型和數據可視化。
 
 ---
 
-It's better at dealing with advanced statistical methods.
+爲分析選擇所需的結論。
 
 ---
 
-There are many powerful libraries that support R.
+修復不正確的值並刪除無效數據。
 
 ---
 
-It's free and open source.
+將數據轉換爲適當的數據結構。
 
 ## --video-solution--
 
 2
-
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
index 137b9f53bd..f5913da1bb 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c150
-title: Jupyter Notebooks Cells
+title: Jupyter Notebooks 單元格
 challengeType: 11
 videoId: 5PPegAs9aLA
 dashedName: jupyter-notebooks-cells
@@ -8,31 +8,30 @@ dashedName: jupyter-notebooks-cells
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
--   [Twitter Cheat Sheet](https://twitter.com/rmotr_com/status/1122176794696847361)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+Jupyter Notebook 單元格支持的三種主要類型是什麼？
 
 ## --answers--
 
-Code, Markdown, and Python
+Code、Markdown 和 Python
 
 ---
 
-Code, Markdown, and Raw
+Code、Markdown 和 Raw
 
 ---
 
-Markdown, Python, and Raw
+Markdown、Python 和 Raw
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
index 104edcae19..0ddb58592c 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c151
-title: Jupyter Notebooks Importing and Exporting Data
+title: 在 Jupyter Notebooks 中導入和導出數據
 challengeType: 11
 videoId: k1msxD3JIxE
 dashedName: jupyter-notebooks-importing-and-exporting-data
@@ -8,39 +8,38 @@ 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.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
--   [Twitter Cheat Sheet](https://twitter.com/rmotr_com/status/1122176794696847361)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+你可以在 Jupyter Notebook 中導入和使用什麼樣的數據？
 
 ## --answers--
 
-Excel files.
+Excel 文件。
 
 ---
 
-CSV files.
+CSV 文件。
 
 ---
 
-XML files.
+XML 文件
 
 ---
 
-Data from an API.
+來自 API 的數據
 
 ---
 
-All of the above.
+以上全部內容
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md
index 454f7c5646..5e097f7477 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c157
-title: Numpy Algebra and Size
+title: Numpy 代數和大小
 challengeType: 11
 videoId: XAT97YLOKD8
 dashedName: numpy-algebra-and-size
@@ -8,34 +8,34 @@ dashedName: numpy-algebra-and-size
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+內存中，對象的大小（例如列表和數據類型）在 Python 標準庫和 NumPy 庫之間有什麼關係？ 知道這一點，對性能有何影響？
 
 ## --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.
+標準的 Python 對象佔用了比 NumPy 對象更多的內存；標準的 Python 和 NumPy 對象完成的操作時間是大致相同的。
 
 ---
 
-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 對象比標準的 Python 對象佔用更多的內存；Numpy 的對象相比較標準的 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.
+Numpy 對象比標準的 Python 對象佔用更少的內存；標準 Python 的對象相比較 Numpy 的對象更快地完成操作。
 
 ---
 
-Standard Python objects take up more memory than NumPy objects; operations on NumPy objects complete very quickly compared to comparable objects in standard Python.
+標準 Python 的對象比 Numpy 的對象佔用更多的內存；Numpy 的對象相比較標準 Python 的對象更快地完成操作。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md
index b5504e836e..61b5a1bdbf 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c154
-title: Numpy Arrays
+title: Numpy 數組
 challengeType: 11
 videoId: VDYVFHBL1AM
 dashedName: numpy-arrays
@@ -8,18 +8,18 @@ dashedName: numpy-arrays
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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([
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
index f271dff4b0..10b2d94db6 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c156
-title: Numpy Boolean Arrays
+title: Numpy 布爾值的數組
 challengeType: 11
 videoId: N1ttsMmcVMM
 dashedName: numpy-boolean-arrays
@@ -8,18 +8,18 @@ dashedName: numpy-boolean-arrays
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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)
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
index fc38697f40..83aa6ffe5b 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c152
-title: Numpy Introduction A
+title: Numpy 簡介 A
 challengeType: 11
 videoId: P-JjV6GBCmk
 dashedName: numpy-introduction-a
@@ -8,30 +8,30 @@ dashedName: numpy-introduction-a
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+爲什麼 Numpy 是一個重要的卻又不流行的 Python 庫？
 
 ## --answers--
 
-Often you won't work directly with Numpy.
+你常常不會直接使用 Numpy。
 
 ---
 
-It is extremely slow.
+它是極其緩慢的。
 
 ---
 
-Working with Numpy is difficult.
+使用 Numpy 的難度是很大的。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
index a863e42074..4fd546bb88 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c153
-title: Numpy Introduction B
+title: Numpy 簡介 B
 challengeType: 11
 videoId: YIqgrNLAZkA
 dashedName: numpy-introduction-b
@@ -8,34 +8,34 @@ dashedName: numpy-introduction-b
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+整數 `5` 在 Python 中消耗多少內存？
 
 ## --answers--
 
-32 bits
+32 位
 
 ---
 
-20 bytes
+20 字節
 
 ---
 
-16 bytes
+16 字節
 
 ---
 
-8 bits
+8 位
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
index 0072c84019..21977e203c 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c155
-title: Numpy Operations
+title: Numpy 的運算
 challengeType: 11
 videoId: eqSVcJbaPdk
 dashedName: numpy-operations
@@ -8,18 +8,18 @@ dashedName: numpy-operations
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+運行以下代碼後， `a` 的值是多少？
 
 ```py
 a = np.arange(5)
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
index 3d17a73a55..9c9aa1ab62 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c15b
-title: Pandas Conditional Selection and Modifying DataFrames
+title: Pandas 條件選擇和 DataFrames 的修改
 challengeType: 11
 videoId: BFlH0fN5xRQ
 dashedName: pandas-conditional-selection-and-modifying-dataframes
@@ -8,18 +8,18 @@ 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.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
index 7d20f76c4a..c5c94681c9 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c15c
-title: Pandas Creating Columns
+title: Pandas 創建列
 challengeType: 11
 videoId: _sSo2XZoB3E
 dashedName: pandas-creating-columns
@@ -8,18 +8,18 @@ dashedName: pandas-creating-columns
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+哪段代碼可以向 DataFrame `certificates_earned` 中添加一個 “Certificates per month” 列，就像下面所展示的？
 
 <pre>      Certificates  Time (in months)  Certificates per month
 Tom               8                16                    0.50
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
index fd5eedb176..b07b97188c 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
@@ -8,18 +8,18 @@ dashedName: pandas-dataframes
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
index 1107f217f4..d5c63c63bb 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c159
-title: Pandas Indexing and Conditional Selection
+title: Pandas 索引和條件選擇
 challengeType: 11
 videoId: '-ZOrgV_aA9A'
 dashedName: pandas-indexing-and-conditional-selection
@@ -8,18 +8,18 @@ dashedName: pandas-indexing-and-conditional-selection
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
index 45a30bc050..67cff2367d 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c158
-title: Pandas Introduction
+title: Pandas 簡介
 challengeType: 11
 videoId: 0xACW-8cZU0
 dashedName: pandas-introduction
@@ -8,18 +8,18 @@ dashedName: pandas-introduction
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
index 284a5eabab..0c2b38b7d1 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c164
-title: Parsing HTML and Saving Data
+title: 解析 HTML 和保存數據
 challengeType: 11
 videoId: bJaqnTWQmb0
 dashedName: parsing-html-and-saving-data
@@ -8,18 +8,18 @@ dashedName: parsing-html-and-saving-data
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas/tree/master/unit-1-reading-data-with-python-and-pandas/lesson-17-reading-html-tables/files)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+爲了解析 HTML 文本和提取表格，`.read_html()` 位於哪個 Python 的庫？
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
index 75a9a71e77..5839f5adfd 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c166
-title: Python Functions and Collections
+title: Python 函數和集合
 challengeType: 11
 videoId: NzpU17ZVlUw
 dashedName: python-functions-and-collections
@@ -8,30 +8,30 @@ dashedName: python-functions-and-collections
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+在 Python 中，列表和元組有什麼主要的區別？
 
 ## --answers--
 
-Tuples are immutable.
+元組是不可改變的。
 
 ---
 
-Lists are ordered.
+列表是有順序的。
 
 ---
 
-Tuples are unordered.
+元組是無序的。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
index f67c83c389..3a79987ce3 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c165
-title: Python Introduction
+title: Python 簡介
 challengeType: 11
 videoId: PrQV9JkLhb4
 dashedName: python-introduction
@@ -8,34 +8,34 @@ dashedName: python-introduction
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+我們如何在 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.
+我們使用縮進，通常是右對齊的 4 個空格。
 
 ---
 
-We do not denote blocks of code.
+我們不用指示出代碼塊。
 
 ---
 
-We could use curly braces or indentation to denote blocks of code.
+我們可以使用大括號或縮進來指示出代碼塊。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
index 4d4350768f..03706c919b 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c167
-title: Python Iteration and Modules
+title: Python 迭代和模塊
 challengeType: 11
 videoId: XzosGWLafrY
 dashedName: python-iteration-and-modules
@@ -8,18 +8,18 @@ dashedName: python-iteration-and-modules
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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`?
+您將如何迭代並打印名爲 `user` 的字典的鍵和值？
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
index 18d6487a0a..0ab7794aeb 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c162
-title: Reading Data CSV and TXT
+title: 從 CSV 和 TXT 中讀取數據
 challengeType: 11
 videoId: ViGEv0zOzUk
 dashedName: reading-data-csv-and-txt
@@ -8,18 +8,18 @@ dashedName: reading-data-csv-and-txt
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas/tree/master/unit-1-reading-data-with-python-and-pandas/lesson-1-reading-csv-and-txt-files/files)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+你如何使用 Pandas 模塊導入 CSV 文件 `data.csv` 並且存儲到 DataFrame 中？
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
index 5502a07e7a..61dce682b0 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c163
-title: Reading Data from Databases
+title: 從數據庫中讀取數據
 challengeType: 11
 videoId: MtgXS1MofRw
 dashedName: reading-data-from-databases
@@ -8,30 +8,30 @@ dashedName: reading-data-from-databases
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas/tree/master/unit-1-reading-data-with-python-and-pandas/lesson-11-reading-data-from-relational-databases/files)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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?
+`Cursor` 實例中都有什麼方法，這些方法能用來做什麼？
 
 ## --answers--
 
-The `Cursor` instance has a `.run()` method which allows you to run SQL queries.
+`Cursor` 實例中有方法 `.run()` ，它允許你運行 SQL 查詢語句。
 
 ---
 
-The `Cursor` instance has a `.select()` method which allows you to select records.
+`Cursor` 實例中有方法 `.select()` ，它允許你選擇記錄。
 
 ---
 
-The `Cursor` instance has an `.execute()` method which will receive SQL parameters to run against the database.
+`Cursor` 實例有方法 `.execute()` ， 它能夠接收在數據庫中運行的 SQL 參數。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
index a16b2d0176..c3bc1b9eb4 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c161
-title: Reading Data Introduction
+title: 讀取數據簡介
 challengeType: 11
 videoId: cDnt02BcHng
 dashedName: reading-data-introduction
@@ -8,18 +8,18 @@ dashedName: reading-data-introduction
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*在視頻中我們使用的編輯器工具是在 notebook.ai 這個平臺，你也可以選擇用其他的平臺，比如說 Google Colab 也是一個不錯的選擇。*
 
-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)
+-   [在 GitHub 平臺的 Notebooks](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas/tree/master/unit-1-reading-data-with-python-and-pandas/lesson-1-reading-csv-and-txt-files/files)
+-   [如何使用 Google Colab 來打開 GitHub 上的 Notebooks](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:
+文件 `certificates.csv` 有以下內容：
 
 <pre>
 Name$Certificates$Time (in months)
@@ -29,7 +29,7 @@ Ahmad$5$9
 Beau$6$12
 </pre>
 
-Fill in the blanks for the missing arguments below:
+請填寫以下缺失的參數：
 
 ```py
 import csv
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
index 66246f3d5d..4d0c9a677a 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
@@ -1,23 +1,24 @@
 ---
 id: 5e46f7e5ac417301a38fb929
-title: Demographic Data Analyzer
+title: 人口統計數據分析器
 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.
+在這個挑戰中，你必須使用 Pandas 對人口統計進行分析。 你將獲得從 1994 年人口普查數據庫中提取的人口統計數據數據集。
 
-You can access [the full project description and starter code on Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-demographic-data-analyzer).
+你可以[在 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.
+點擊此鏈接，fork 這個項目。 一旦你根據 “README.md” 中的說明完成項目，請提交你的項目鏈接到下面。
 
-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.
+我們仍在開發 Python 數據分析課程的交互式教學。 現在，你需要使用其他資源來學習如何通過這一挑戰。
 
 # --hints--
 
-It should pass all Python tests.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
index 4d7cfc2f13..b0d1029027 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
@@ -1,23 +1,24 @@
 ---
 id: 5e46f7f8ac417301a38fb92a
-title: Medical Data Visualizer
+title: 醫療數據可視化工具
 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.
+在這個項目中，你將要使用 matplotlib，seaborn 和 pandas 來對健康檢查數據進行數據可視化和計算。
 
-You can access [the full project description and starter code on Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-medical-data-visualizer).
+你可以[在 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.
+打開此鏈接後，fork 這個項目。 一旦你根據 “README.md” 中的說明完成項目，請提交你的項目到下面的鏈接。
 
-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.
+我們仍在開發 Python 數據分析課程的交互式課程部分。 現在，你需要使用其他資源來學習如何通過這一挑戰。
 
 # --hints--
 
-It should pass all Python tests.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
index b33d2eeed6..414b111006 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
@@ -1,23 +1,24 @@
 ---
 id: 5e46f802ac417301a38fb92b
-title: Page View Time Series Visualizer
+title: 頁面訪問量的時間序列可視化工具
 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.
+對於這個項目，你將使用線圖、條形圖和箱形圖對時間序列數據進行可視化。 你將要使用 Pandas、matplotlib 和 seaborn 來對數據集進行可視化，這個數據集包含從 2016-05-09 到 2019-12-03 每一天在 freeCodeCamp.org 論壇的頁面訪問量。 這個數據可視化將幫助你瞭解訪問的模式，並且顯示年增長和月增長情況。
 
-You can access [the full project description and starter code on Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer).
+你可以 [在 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.
+點擊此鏈接，fork 這個項目。 一旦你根據 “README.md” 中的說明完成項目，請提交你的項目到下面的鏈接。
 
-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.
+我們仍在開發 Python 數據分析課程的交互式課程部分。 現在，你將需要使用其他資源來學習如何通過這一挑戰。
 
 # --hints--
 
-It should pass all Python tests.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
index 58075caec0..b2836a4656 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
@@ -1,23 +1,24 @@
 ---
 id: 5e4f5c4b570f7e3a4949899f
-title: Sea Level Predictor
+title: 海平面預報器
 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.
+在本項目中，您將分析自 1880 年以來全球平均海平面變化的數據集。 您將使用這些數據來預測到 2050 年的海平面變化。
 
-You can access [the full project description and starter code on Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-sea-level-predictor).
+你可以在 [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.
+打開此鏈接後，fork 這個項目。 一旦你根據 “README.md” 中的說明完成項目，請提交你的項目到下面的鏈接。
 
-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.
+我們仍在開發 Python 數據分析課程的交互式課程部分。 現在，你需要使用其他資源來學習如何通過這一挑戰。
 
 # --hints--
 
-It should pass all Python tests.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md
index 3c833be5ad..3e4d45c8ee 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0a8e09c5df3cc3600ed4
-title: 'Accessing and Changing Elements, Rows, Columns'
+title: '訪問與更改元素、行和列'
 challengeType: 11
 videoId: v-7Y7koJ_N0
 dashedName: accessing-and-changing-elements-rows-columns
@@ -10,7 +10,7 @@ dashedName: accessing-and-changing-elements-rows-columns
 
 ## --text--
 
-What code would change the values in the 3rd column of both of the following Numpy arrays to 20?
+以下哪行代碼將下面的 Numpy 數組的第三行的數值都更改成 20？
 
 ```py
 a = np.array([[1, 2, 3, 4, 5], [6, 7, 8, 9, 10]])
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/basics-of-numpy.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/basics-of-numpy.md
index 57b1924af7..54be13c1bd 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/basics-of-numpy.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/basics-of-numpy.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0a8e09c5df3cc3600ed3
-title: Basics of Numpy
+title: Numpy 的基礎知識
 challengeType: 11
 videoId: f9QrZrKQMLI
 dashedName: basics-of-numpy
@@ -10,7 +10,7 @@ dashedName: basics-of-numpy
 
 ## --text--
 
-What will the following code print?
+以下代碼將打印出什麼？
 
 ```python
 b = np.array([[1.0,2.0,3.0],[3.0,4.0,5.0]])
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/copying-arrays-warning.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/copying-arrays-warning.md
index afe7b8d83e..ba1d60a935 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/copying-arrays-warning.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/copying-arrays-warning.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0a8e09c5df3cc3600ed7
-title: Copying Arrays Warning
+title: 複製數組警告
 challengeType: 11
 videoId: iIoQ0_L0GvA
 dashedName: copying-arrays-warning
@@ -10,7 +10,7 @@ dashedName: copying-arrays-warning
 
 ## --text--
 
-What is the value of `a` after running the following code?
+運行以下代碼後， `a` 的值是多少？
 
 ```py
 import numpy as np
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/initialize-array-problem.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/initialize-array-problem.md
index 34e8f27604..255a51d732 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/initialize-array-problem.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/initialize-array-problem.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0a8e09c5df3cc3600ed6
-title: Initialize Array Problem
+title: 初始化數組問題
 challengeType: 11
 videoId: 0jGfH8BPfOk
 dashedName: initialize-array-problem
@@ -10,7 +10,7 @@ dashedName: initialize-array-problem
 
 ## --text--
 
-What is another way to produce the following array?
+產生以下數組的另一種方式是什麼？
 
 ```py
 [[0. 0. 0. 0. 0. 0. 0.]
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/initializing-different-arrays.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/initializing-different-arrays.md
index a6957cc7e4..238e02321d 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/initializing-different-arrays.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/initializing-different-arrays.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0a8e09c5df3cc3600ed5
-title: Initializing Different Arrays
+title: 初始化不同的數組
 challengeType: 11
 videoId: CEykdsKT4U4
 dashedName: initializing-different-arrays
@@ -10,7 +10,7 @@ dashedName: initializing-different-arrays
 
 ## --text--
 
-What will the following code print?
+以下代碼將打印出什麼？
 
 ```py
 a = np.array([[1, 2, 3, 4, 5], [6, 7, 8, 9, 10]])
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/mathematics.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/mathematics.md
index f3b1a3c111..5ef28be2c3 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/mathematics.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/mathematics.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0a8e09c5df3cc3600ed8
-title: Mathematics
+title: 數學
 challengeType: 11
 videoId: 7txegvyhtVk
 dashedName: mathematics
@@ -10,7 +10,7 @@ dashedName: mathematics
 
 ## --text--
 
-What is the value of `b` after running the following code?
+運行以下代碼後， `b` 的值是多少？
 
 ```py
 import numpy as np
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/reorganizing-arrays.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/reorganizing-arrays.md
index 7e4903c864..6705895d72 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/reorganizing-arrays.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/numpy/reorganizing-arrays.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0a8e09c5df3cc3600ed9
-title: Reorganizing Arrays
+title: 重組數組
 challengeType: 11
 videoId: VNWAQbEM-C8
 dashedName: reorganizing-arrays
@@ -10,7 +10,7 @@ dashedName: reorganizing-arrays
 
 ## --text--
 
-What code would produce the following array?
+哪個代碼會生成下面的數組？
 
 ```py
 [[1. 1.]
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/anonymous-message-board.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/anonymous-message-board.md
index 20970a8e21..4bcf54054c 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/anonymous-message-board.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/anonymous-message-board.md
@@ -1,6 +1,6 @@
 ---
 id: 587d824a367417b2b2512c45
-title: Anonymous Message Board
+title: 匿名留言板
 challengeType: 4
 forumTopicId: 301568
 dashedName: anonymous-message-board
@@ -8,38 +8,38 @@ dashedName: anonymous-message-board
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://anonymous-message-board.freecodecamp.rocks/>.
+構建一個功能上與此相似的全棧式 JavaScript 應用程序：<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 repl.it starter project](https://repl.it/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.
+-   克隆[這個 GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-messageboard/) 並在本地完成你的項目。
+-   使用 [我們的 Replit 啓動項目](https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard)來完成你的項目。
+-   使用一個你喜歡的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
-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.
+完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後將 URL 提交到 `Solution Link` 中。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
 
 # --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`
+1.  當準備寫測試和數據庫連接字符串時，設置`NODE_ENV`爲不帶引號的變量（在`.env`文件中）。
+2.  建議在 `routes/api.js` 中創建控制器/處理器並處理路由。
+3.  你將在 `server.js` 中添加任何安全功能。
 
-Write the following tests in `tests/2_functional-tests.js`:
+在 `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/threads/{board}` with an invalid `delete_password`
--   Deleting a reply with the correct password: DELETE request to `/api/threads/{board}` with a valid `delete_password`
--   Reporting a reply: PUT request to `/api/replies/{board}`
+-   創建一個新的主題：發送 POST 請求到 `/api/threads/{board}`。
+-   查看最近的 10 個主題，每個主題有 3 個回覆：發送 GET 請求到 `/api/threads/{board}`
+-   使用錯誤密碼刪除主題：使用錯誤的`delete_password`向`/api/threads/{board}`發出DELETE請求
+-   用正確的密碼刪除一個主題：向`/api/threads/{board}`發出DELETE請求，並提供有效的`delete_password`。
+-   報告一個主題：發送 PUT 請求到 `/api/threads/{board}`。
+-   創建一個新的回覆：發送 POST 請求到 `/api/replies/{board}`。
+-   查看一個帶有所有回覆的主題：發送 GET 請求到`/api/replies/{board}`。
+-   使用錯誤密碼刪除一個回覆：使用無效的`delete_password`向`/api/replies/{board}`發出DELETE請求。
+-   使用正確密碼刪除一個回覆：使用有效的`delete_password`向`/api/replies/{board}`發出DELETE請求。
+-   報告一個回覆：發送 PUT 請求到 `/api/replies/{board}`。
 
 # --hints--
 
-You can provide your own project, not the example URL.
+提交自己的項目，而不是示例的 URL。
 
 ```js
 (getUserInput) => {
@@ -51,7 +51,7 @@ You can provide your own project, not the example URL.
 };
 ```
 
-Only allow your site to be loaded in an iFrame on your own pages.
+只允許你的網站在你自己的頁面上以 iFrame 方式加載。
 
 ```js
 async (getUserInput) => {
@@ -61,7 +61,7 @@ async (getUserInput) => {
 };
 ```
 
-Do not allow DNS prefetching.
+不允許 DNS 預取。
 
 ```js
 async (getUserInput) => {
@@ -71,7 +71,7 @@ async (getUserInput) => {
 };
 ```
 
-Only allow your site to send the referrer for your own pages.
+只允許你的網站爲你自己的頁面發送 referrer 請求頭。
 
 ```js
 async (getUserInput) => {
@@ -81,55 +81,81 @@ async (getUserInput) => {
 };
 ```
 
-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).
+你可以向 `/api/threads/{board}` 發送一個 POST 請求，其中包括 `text` 和 `delete_password` 的表單數據。 保存的數據庫記錄將至少有 `_id`、`text`、`created_on`(date & time)、`bumped_on`(date & time, starts same as `created_on`)、`reported`（布爾值）、`delete_password`、& `replies`（數組）。
+
+```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}`);
+  }
+};
+```
+
+你可以向 `/api/replies/{board}` 發送一個 POST 請求，其中包括字段 `text`、`delete_password` & `thread_id`。 這將更新 `bumped_on` 日期到評論日期。 在主題的 `replies` 數組中，將保存一個對象，至少有 `_id`、`text`、`created_on`、`delete_password`、& `reported` 這些屬性。
 
 ```js
 
 ```
 
-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`.
+你可以向 `/api/threads/{board}` 發送一個 GET 請求。 返回的將是一個數組，包括論壇上最近的 10 個被回覆的主題，及每個主題最新的 3 個回帖。 `reported` 和 `delete_password` 字段將不會被髮送到客戶端。
 
 ```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.
+你可以向 `/api/replies/{board}?thread_id={thread_id}` 發送一個 GET 請求。 返回的將是帶有所有的回覆的整個主題，不包括與之前測試相同的客戶端字段。
 
 ```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.
+你可以向 `/api/threads/{board}` 發送一個 DELETE 請求，並傳遞 `thread_id` & `delete_password` 來刪除該線程。 返回的將是字符串 `incorrect password` 或 `success`。
 
 ```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`.
+你可以向 `/api/replies/{board}` 發送一個 DELETE 請求，並傳遞 `thread_id`、`reply_id`、& `delete_password`。 返回的將是字符串 `incorrect password` 或 `success`。 成功後，`reply_id` 的文本將更改爲 `[deleted]`。
 
 ```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]`.
+你可以向 `/api/threads/{board}` 發送一個 PUT 請求，並傳遞 `thread_id`。 返回的將是字符串 `success`。 `thread_id` 回覆的 `reported` 值將改爲 `true`。
 
 ```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`.
+你可以通過向 `/api/replies/{board}` 發送 PUT 請求並傳遞 `thread_id` & `reply_id`。 返回的將是字符串 `success`。 `reply_id` 的 `reported` 值將被改變爲 `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.
+所有 10 項功能測試都已完成並通過。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/port-scanner.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/port-scanner.md
index 5c776ca7d0..fc0bb64c55 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/port-scanner.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/port-scanner.md
@@ -1,33 +1,34 @@
 ---
 id: 5e46f979ac417301a38fb932
-title: Port Scanner
+title: 端口掃描器
 challengeType: 10
+forumTopicId: 462372
 helpCategory: Python
 dashedName: port-scanner
 ---
 
 # --description--
 
-Create a port scanner using Python.
+使用 Python 創建一個端口掃描器。
 
-You can access [the full project description and starter code on Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-port-scanner).
+你可以訪問 [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.
+在打開鏈接之後 fork 該項目。 根據 “README.md” 中的指示完成整個項目，然後在下面提交你的項目鏈接。
 
-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:
+Python 課程的交互式教學部分仍在開發當中。 目前，freeCodeCamp YouTube 頻道上的一些視頻將會教授你這個項目要求的一些 Python 技能。
 
 <ul>
   <li>
-    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody 視頻課程</a>（14 小時）
   </li>
   <li>
-    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python 視頻課程</a>（2 小時）
   </li>
 </ul>
 
 # --hints--
 
-It should pass all Python tests.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
index 3ced001df3..c9f85c9f16 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
@@ -1,23 +1,28 @@
 ---
 id: 5e601c775ac9d0ecd8b94aff
-title: Secure Real Time Multiplayer Game
+title: 安全的實時多人遊戲
 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:
+使用 HTML Canvas API 和 [Socket.io](https://socket.io/) 開發一個 2D 實時多人遊戲，其功能與此類似：<https://secure-real-time-multiplayer-game.freecodecamp.rocks/>。 在這個項目中，你將使用以下方法之一編寫你的代碼：
 
--   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/) and complete your project locally.
--   Use [our repl.it starter project](https://repl.it/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.
+-   克隆[這個 GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/)，並在本地完成你的項目。
+-   使用[我們的 Replit 初始項目](https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game)來完成你的項目。
+-   使用您選擇的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
-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.
+完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 框中提交你的項目 URL。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
+
+# --instructions--
+
+**注意** ：`helmet@^3.21.3` 是用戶故事所必需的。 這意味着你需要使用以前版本的 Helmet 的文檔，瞭解如何實現用戶故事的信息。
 
 # --hints--
 
-You can provide your own project, not the example URL.
+提交自己的項目，而不是示例的 URL。
 
 ```js
 (getUserInput) => {
@@ -29,112 +34,134 @@ You can provide your own project, not the example 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`.
+每個玩家都由在 `Player.mjs` 中創建的 `Player` 類對象來代表。
 
 ```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.
+至少，每個玩家對象應該包含一個唯一的 `id`、一個 `score`，以及代表玩家當前位置的 `x` 和 `y` 座標。
 
 ```js
 
 ```
 
-The game has at least one type of collectible item. Complete the `Collectible` class in `Collectible.mjs` to implement this.
+遊戲至少有一種類型的可收藏物品。 在 `Collectible.mjs` 中完成 `Collectible` 類來實現這一點。
 
 ```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.
+至少，每個由 `Collectible` 類創建的可收集物品對象應該包含一個唯一的 `id`、一個 `value`，以及代表該物品當前位置的 `x` 和 `y` 座標。
 
 ```js
 
 ```
 
-Players can use the WASD and/or arrow keys to move their avatar. Complete the `movePlayer` method in `Player.mjs` to implement this.
+玩家可以使用 WASD 或方向鍵移動頭像。 完成 `Player.mjs` 中的 `movePlayer` 方法來實現這一功能。
 
 ```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.
+`movePlayer` 方法應該接受兩個參數：一個是 “up”、“down”、“left” 或 “right” 的字符串，另一個是玩家角色位置應該改變的像素數量。 `movePlayer` 應該調整它所調用的玩家對象的 `x` 和 `y` 座標。
 
 ```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.
+用玩家的分數來計算他們相對其他玩家的名次。 在 `Player` 類中完成 `calculateRank` 方法來實現這個。
 
 ```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`.
+`calculateRank` 方法應該接受一個代表所有在線玩家的對象數組，並返回字符串 `Rank: currentRanking/totalPlayers`。 例如，在一局有兩個玩家的遊戲中，如果玩家 A 的分數是 3，玩家 B 的分數是 5，那麼玩家 A 的 `calculateRank` 應該返回 `Rank: 2/2`。
 
 ```js
 
 ```
 
-Players can collide with a collectible item. Complete the `collision` method in `Player.mjs` to implement this.
+玩家可以與可收集物品發生碰撞。 完成 `Player.mjs` 中的 `collision` 方法來實現這一點。
 
 ```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`.
+`collision` 方法應該接受一個可收集物品的對象作爲參數。 如果玩家的頭像與物品相交，`collision` 方法應該返回 `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.
+阻止客戶端試圖猜測/嗅探 MIME 類型。
 
 ```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.
+防止跨站腳本（XSS）攻擊。
 
 ```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).
+請求頭顯示該網站是由 “PHP 7.4.3” 驅動的，儘管實際並非如此（作爲一種安全防禦措施）。
 
 ```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--
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/sha-1-password-cracker.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/sha-1-password-cracker.md
index 8a79bb1b7c..7a74cecb66 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/sha-1-password-cracker.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/sha-1-password-cracker.md
@@ -1,33 +1,34 @@
 ---
 id: 5e46f983ac417301a38fb933
-title: SHA-1 Password Cracker
+title: SHA-1 密碼破解器
 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.
+在這個項目中，你將通過創建一個密碼破解器來找出使用 SHA-1 散列的密碼，從而瞭解到良好安全的重要性。
 
-You can access [the full project description and starter code on Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-SHA-1-password-cracker).
+你可以訪問 [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.
+進入該鏈接後，fork 該項目。 一旦你根據 “README.md” 中的說明完成了項目，請在下面提交你的項目鏈接。
 
-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:
+我們仍在開發 Python 課程的交互式教學部分。 目前，freeCodeCamp.org YouTube 頻道上的一些視頻可以教你這個項目所需的一些 Python 技能。
 
 <ul>
   <li>
-    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody 視頻課程</a>（14 小時）
   </li>
   <li>
-    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python 視頻課程</a>（2 小時）
   </li>
 </ul>
 
 # --hints--
 
-It should pass all Python tests.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/stock-price-checker.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/stock-price-checker.md
index ce584c58d5..d2debe662a 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/stock-price-checker.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-projects/stock-price-checker.md
@@ -1,6 +1,6 @@
 ---
 id: 587d824a367417b2b2512c44
-title: Stock Price Checker
+title: 股票價格查看器
 challengeType: 4
 forumTopicId: 301572
 dashedName: stock-price-checker
@@ -8,36 +8,36 @@ dashedName: stock-price-checker
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://stock-price-checker.freecodecamp.rocks/>.
+構建一個 JavaScript 的全棧應用，在功能上與這個應用相似：<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.
+由於所有可靠的股票價格 API 都需要一個 API 密鑰，我們已經建立了一個解決方案。 使用 [https://stock-price-checer-proxy.freecodecamp.rocks/](https://stock-price-checker-proxy.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-stockchecker/) and complete your project locally.
--   Use [our repl.it starter project](https://repl.it/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.
+-   克隆 [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-stockchecker/) 並在本地完成項目。
+-   使用[我們的 Replit 啓動項目](https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker)來完成你的項目。
+-   使用你選擇的網站生成器來完成項目。 需要包含我們 GitHub 倉庫的所有文件。
 
-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.
+完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後將 URL 提交到 `Solution Link` 中。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
 
 # --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`
+1.  將 `NODE_ENV` 設置爲 `test`，不帶引號，並將 `DB` 設爲你的 MongoDB 連接字符串。
+2.  在 `routes/api.js` 中完成項目，或者通過創建一個處理程序/控制器來完成項目
+3.  添加安全功能到 `server.js`。
+4.  在 `tests/2_functional-tests.js` 中創建所有的功能測試
 
-Write the following tests in `tests/2_functional-tests.js`:
+在 `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/`
+-   查看股價：發送 GET 請求到 `/api/stock-prices/`
+-   查看一個股票並關注它：發送 GET 請求到 `/api/stock-prices/`
+-   查看同一只股票並再次發送關注：發送 GET 請求到 `/api/stock-prices/`
+-   查看兩隻股票：發送 GET 請求到 `/api/stock-prices/`
+-   查看兩隻股票並關注它：發送 GET 請求到 `/api/stock-prices/`
 
 # --hints--
 
-You can provide your own project, not the example URL.
+提交自己的項目，而不是示例的 URL。
 
 ```js
 (getUserInput) => {
@@ -47,7 +47,7 @@ You can provide your own project, not the example URL.
 };
 ```
 
-You should set the content security policies to only allow loading of scripts and CSS from your server.
+將內容安全策略設置爲僅允許從服務器加載腳本和 CSS。
 
 ```js
 async (getUserInput) => {
@@ -62,7 +62,7 @@ async (getUserInput) => {
 };
 ```
 
-You can send a `GET` request to `/api/stock-prices` with form data containing a NASDAQ stock ticker. Returned will be an object with the property `stockData`.
+你可以向 `/api/stock-prices` 發送一個 `GET` 請求，將納斯達克股票代碼賦值給 `stock` 查詢參數。 返回的對象將包含一個名爲 `stockData` 的屬性。
 
 ```js
 async (getUserInput) => {
@@ -74,7 +74,7 @@ async (getUserInput) => {
 };
 ```
 
-The `stockData` property includes the `stock` ticker as a string, the `price` as a number, and `likes` as a number.
+`stockData` 屬性包括字符串 `stock` 代碼、數字 `price`，以及數字 `likes`。
 
 ```js
 async (getUserInput) => {
@@ -89,13 +89,13 @@ async (getUserInput) => {
 };
 ```
 
-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.
+你也可以用作爲 `true`（布爾值）來傳遞 `like` 字段，讓你的偏好添加到股票中。 每個 IP 應該只接受 1 個贊。
 
 ```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.
+如果你傳遞了兩隻股票，返回值將是一個包含這兩隻股票信息的數組。 它將會顯示對於兩個 `stockData` 對象的 `rel_likes`（兩隻股票所獲得的贊同數的區別），而不是 `likes`。
 
 ```js
 async (getUserInput) => {
@@ -110,7 +110,7 @@ async (getUserInput) => {
 };
 ```
 
-All 5 functional tests are complete and passing.
+所有 5 項功能測試都已完成並通過。
 
 ```js
 async (getUserInput) => {
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
index 6bf78cfccc..c028f37491 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8248367417b2b2512c3c
-title: Ask Browsers to Access Your Site via HTTPS Only with helmet.hsts()
+title: 用 helmet.hsts() 使瀏覽器只能通過 HTTPS 訪問你的網站。
 challengeType: 2
 forumTopicId: 301573
 dashedName: ask-browsers-to-access-your-site-via-https-only-with-helmet-hsts
@@ -8,19 +8,19 @@ 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 [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。你也可以從 [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.
+HTTP 嚴格傳輸安全（HSTS）是一種網絡安全策略，有助於保護網站免受協議降級攻擊和 cookie 劫持。 如果你的網站可以通過 HTTPS 訪問，你可以要求用戶的瀏覽器避免使用不安全的 HTTP。 通過設置標頭 Strict-Transport-Security，你告訴瀏覽器在指定時間內對未來的請求使用 HTTPS。 這將對初始請求之後的請求起作用。
 
 # --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`. Repl.it 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 Repl.it header, after inspecting it for testing.
+配置 `helmet.hsts()` 以在未來 90 天內使用 HTTPS。 傳遞配置對象 `{maxAge: timeInSeconds, force: true}`。 你可以創建一個變量 `ninetyDaysInSeconds = 90*24*60*60;` 來用於 `timeInSeconds`。 Replit 已經啓用了 hsts。 要覆蓋它的設置，你需要在配置對象中把 “force” 字段設置爲 true。 我們將攔截並在對其進行檢查測試後恢復 Replit 請求頭。
 
-Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and a SSL/TLS Certificate.
+注意：在自定義網站上配置 HTTPS 需要獲得一個域名，以及一個 SSL/TLS 證書。
 
 # --hints--
 
-helmet.hsts() middleware should be mounted correctly
+helmet.hsts() 中間件應該被正確安裝。
 
 ```js
 (getUserInput) =>
@@ -35,7 +35,7 @@ helmet.hsts() middleware should be mounted correctly
   );
 ```
 
-maxAge should be equal to 7776000 s (90 days)
+maxAge 應該等於 7776000 秒（90 天）。
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
index 2bbd3bf02e..3df51eff7f 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8248367417b2b2512c3a
-title: Avoid Inferring the Response MIME Type with helmet.noSniff()
+title: 用 helmet.noSniff() 避免推斷出響應的 MIME 類型。
 challengeType: 2
 forumTopicId: 301574
 dashedName: avoid-inferring-the-response-mime-type-with-helmet-nosniff
@@ -8,15 +8,15 @@ 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 [Repl.it](https://repl.it/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`.
+請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。 瀏覽器可以使用內容或 MIME 嗅探來覆蓋響應的 `Content-Type` 頭，猜測並使用隱含的內容類型來處理數據。 雖然這在某些情況下可能很方便，但也可能導致一些危險的攻擊。 該中間件將 X-Content-Type-Options 頭設置爲 `nosniff`，指示瀏覽器不要繞過所提供的 `Content-Type`。
 
 # --instructions--
 
-Use the `helmet.noSniff()` method on your server.
+在你的服務器上使用 `helmet.noSniff()` 方法。
 
 # --hints--
 
-helmet.noSniff() middleware should be mounted correctly
+helmet.noSniff() 中間件應該被正確安裝
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
index 6865d3896c..9a72ee091b 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8249367417b2b2512c40
-title: Configure Helmet Using the ‘parent’ helmet() Middleware
+title: 使用 helmet() 中間件來配置 Helmet
 challengeType: 2
 forumTopicId: 301575
 dashedName: configure-helmet-using-the-parent-helmet-middleware
@@ -8,11 +8,11 @@ dashedName: configure-helmet-using-the-parent-helmet-middleware
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。你也可以從 [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.
+`app.use(helmet())` 將自動包括上面介紹的所有中間件，除了 `noCache()` 和 `contentSecurityPolicy()`，但如果有必要，這些可以被啓用。 你也可以使用配置對象，單獨禁用或配置任何其他中間件。
 
-**Example:**
+**例如：**
 
 ```js
 app.use(helmet({
@@ -21,7 +21,7 @@ app.use(helmet({
   },
   contentSecurityPolicy: {    // enable and configure
     directives: {
-      defaultSrc: ["self"],
+      defaultSrc: ["'self'"],
       styleSrc: ['style.com'],
     }
   },
@@ -29,11 +29,11 @@ app.use(helmet({
 }))
 ```
 
-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.
+爲了教學目的和便於測試，我們分別介紹了每個中間件。 使用“父”`helmet()` 中間件很容易在真實項目中實現。
 
 # --hints--
 
-no tests - it's a descriptive challenge
+沒有測試 - 這是一個描述性的挑戰
 
 ```js
 assert(true);
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
index 21cf373400..5ecebfe01f 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8249367417b2b2512c3e
-title: Disable Client-Side Caching with helmet.noCache()
+title: 使用 helment.noCache() 禁用客戶端緩存
 challengeType: 2
 forumTopicId: 301576
 dashedName: disable-client-side-caching-with-helmet-nocache
@@ -8,17 +8,17 @@ dashedName: disable-client-side-caching-with-helmet-nocache
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。 你也可以從[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.
+在你的服務器上使用 `helmet.noCache()` 方法。
 
 # --hints--
 
-helmet.noCache() middleware should be mounted correctly
+應正確加載 helmet.noCache() 中間件
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
index 5d212b6dbe..455ce2a254 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8248367417b2b2512c3d
-title: Disable DNS Prefetching with helmet.dnsPrefetchControl()
+title: 使用 helmet.dnsPrefetchControl() 禁用 DNS 預獲取
 challengeType: 2
 forumTopicId: 301577
 dashedName: disable-dns-prefetching-with-helmet-dnsprefetchcontrol
@@ -8,17 +8,17 @@ dashedName: disable-dns-prefetching-with-helmet-dnsprefetchcontrol
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。你也可以從 [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.
+爲了提高性能，大部分瀏覽器都會爲頁面上的鏈接預先加載 DNS 記錄。 這樣當用戶點擊一個鏈接的時候瀏覽器已經知道其 IP 地址了。 但這也會造成 DNS 服務的過度使用（如果你有一個百萬用戶數量級的大型網站）、隱私問題（竊聽者可以藉此推測出你在訪問哪個頁面）、頁面統計數據準確性（有些沒訪問過的鏈接會被標記成已訪問）。 如果你對安全性要求比較高，你應該禁用 DNS 預加載。 當然，這樣做會讓你損失一些性能。
 
 # --instructions--
 
-Use the `helmet.dnsPrefetchControl()` method on your server.
+應正確加載 helmet.dnsPrefetchControl() 中間件
 
 # --hints--
 
-helmet.dnsPrefetchControl() middleware should be mounted correctly
+應正確加載 helmet.dnsPrefetchControl() 中間件
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
index 5d6126daa7..43ca7a1372 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
@@ -1,6 +1,6 @@
 ---
 id: 58a25bcff9fc0f352b528e7d
-title: Hash and Compare Passwords Asynchronously
+title: 哈希和異步比較密碼
 challengeType: 2
 forumTopicId: 301578
 dashedName: hash-and-compare-passwords-asynchronously
@@ -8,9 +8,9 @@ dashedName: hash-and-compare-passwords-asynchronously
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-bcrypt), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。 你也可以從[GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/)上克隆。
 
-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) => {
@@ -20,9 +20,9 @@ bcrypt.hash(myPlaintextPassword, saltRounds, (err, hash) => {
 
 # --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) => {
@@ -30,7 +30,7 @@ bcrypt.compare(myPlaintextPassword, hash, (err, res) => {
 });
 ```
 
-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.
+當控制檯輸出生成的哈希並在對比的回調中輸出結果後，我們就可以將其添加到現有的哈希函數中。 控制檯中會首先輸出一個哈希結果，然後輸出 true。 如果將比較函數中的 “myPlaintextPassword” 更改爲 “someOtherPlaintextPassword”，則比較的結果應顯示 false。
 
 ```js
 bcrypt.hash('passw0rd!', 13, (err, hash) => {
@@ -43,11 +43,11 @@ bcrypt.hash('passw0rd!', 13, (err, hash) => {
 
 ```
 
-Submit your page when you think you've got it right.
+請在完成挑戰後提交你的頁面。
 
 # --hints--
 
-Async hash should be generated and correctly compared.
+應生成異步散列並正確比較。
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
index c03109f16a..c19836bc32 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
@@ -1,6 +1,6 @@
 ---
 id: 58a25bcff9fc0f352b528e7e
-title: Hash and Compare Passwords Synchronously
+title: 哈希和同步比較密碼
 challengeType: 2
 forumTopicId: 301579
 dashedName: hash-and-compare-passwords-synchronously
@@ -8,31 +8,31 @@ dashedName: hash-and-compare-passwords-synchronously
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-bcrypt), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+請注意，本項目在 [這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt) 的基礎上進行開發。 你也可以從 [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:
+把同步哈希的方法添加到你的代碼，並在控制檯輸出。 和之前一樣，我們已經爲你定義好了你需要使用的變量，你不需要做任何改動。 你可能會注意到即使你使用與異步函數相同的密碼進行哈希處理，控制檯中的結果也不同，這是由於每次哈希值隨機生成，如第三個哈希字符串中的前 22 個字符所示。 現在，爲了比較一個密碼輸入和新的同步哈希值，你將使用 compareSync 方法。
 
 ```js
 var result = bcrypt.compareSync(myPlaintextPassword, hash);
 ```
 
-with the result being a boolean true or false.
+返回的結果爲 true 或 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) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
index 630302ea38..32214afbae 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8247367417b2b2512c37
-title: Hide Potentially Dangerous Information Using helmet.hidePoweredBy()
+title: 使用 helmet.hidePoweredBy() 隱藏潛在的危險信息
 challengeType: 2
 forumTopicId: 301580
 dashedName: hide-potentially-dangerous-information-using-helmet-hidepoweredby
@@ -8,13 +8,13 @@ dashedName: hide-potentially-dangerous-information-using-helmet-hidepoweredby
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。你也可以從 [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. The `helmet.hidePoweredBy()` middleware will remove the X-Powered-By header. You can also explicitly set the header to something else, to throw people off. e.g. `app.use(helmet.hidePoweredBy({ setTo: 'PHP 4.2.0' }))`
+如果黑客發現你的網站是用 Express 搭建的，那麼他們就可以利用 Express 或 Node 現存的漏洞來攻擊你的網站。 `X-Powered-By: Express` 默認在來自 Express 的每個請求中被髮送。 使用 `helmet.hidePoweredBy()` 中間件來移除 X-Powered-By 頭。
 
 # --hints--
 
-helmet.hidePoweredBy() middleware should be mounted correctly
+應正確地安裝 helmet.hidePoweredBy() 中間件
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
index 0a58f1d597..49d5ede425 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8247367417b2b2512c36
-title: Install and Require Helmet
+title: 安裝和引入 Helmet
 challengeType: 2
 forumTopicId: 301581
 dashedName: install-and-require-helmet
@@ -8,26 +8,33 @@ dashedName: install-and-require-helmet
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+你可以採用下面的任意一種編寫代碼的方式來完成這些挑戰：
 
-Helmet helps you secure your Express apps by setting various HTTP headers.
+- 克隆 [這個 GitHub 倉庫](https://github.com/freeCodeCamp/boilerplate-infosec/) 並在本地完成這些挑戰。
+- 使用[我們在 Repl.it 上的初始化項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)來完成這些挑戰。
+- 使用你選擇的網站生成器來完成項目。 需要包含我們 GitHub 倉庫的所有文件。
+
+完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 字段中提交它的 URL。
+
+Helmet 通過設置各種 HTTP 頭來保護你的 Express 應用程序。
 
 # --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.
+你在這些課程中寫的所有代碼都在 `myApp.js` 文件中，在初始代碼之間。 不要改變或刪除我們爲你添加的代碼。
 
-Install Helmet version `3.21.3`, then require it.
+安裝 Helmet 的 `3.21.3` 版本，然後引入它。 你可以用 `npm install --save-exact package@version` 來安裝一個特定版本的軟件包，或者直接將其添加到你的 `package.json` 中。
 
 # --hints--
 
-`helmet` version `3.21.3` should be in `package.json`
+`helmet` 版本 `3.21.3` 應該在 `package.json` 中。
 
 ```js
 (getUserInput) =>
   $.get(getUserInput('url') + '/_api/package.json').then(
     (data) => {
-      var packJson = JSON.parse(data);
-      assert(packJson.dependencies.helmet === '3.21.3');
+      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);
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
index 1759d2e727..dcbf163ddd 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8247367417b2b2512c38
-title: Mitigate the Risk of Clickjacking with helmet.frameguard()
+title: 使用 helmet.frameguard() 降低點擊劫持的風險
 challengeType: 2
 forumTopicId: 301582
 dashedName: mitigate-the-risk-of-clickjacking-with-helmet-frameguard
@@ -8,19 +8,19 @@ dashedName: mitigate-the-risk-of-clickjacking-with-helmet-frameguard
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+請注意，本項目在 [這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec) 的基礎上進行開發。 你也可以從 [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.
+你的網頁可能在未經你同意的情況下被放在 `<frame>` 或 `<iframe>` 中。 這可能會導致點擊劫持攻擊等情況。 點擊劫持是一種欺騙用戶的技術，使其與用戶認爲不同的頁面進行互動。 這可以通過使用 iframe 的方式，在一個惡意的環境中執行你的頁面而獲得。 在這種情況下，黑客可以在你的頁面上設置一個隱藏層。 隱藏的按鈕可以被用來運行壞的腳本。 該中間件設置 X-Frame-Options 頭。 它限制了誰可以把你的網站放在一個框架裏。 它有三種模式：DENY、SAMEORIGIN 和 ALLOW-FROM。
 
-We don’t need our app to be framed.
+我們不需要讓我們的應用程序可以被嵌入。
 
 # --instructions--
 
-Use `helmet.frameguard()` passing with the configuration object `{action: 'deny'}`.
+使用 `helmet.frameguard()` 時應傳遞配置對象 `{action: 'deny'}`。
 
 # --hints--
 
-helmet.frameguard() middleware should be mounted correctly
+應正確加載 helmet.frameguard() 中間件
 
 ```js
 (getUserInput) =>
@@ -38,7 +38,7 @@ helmet.frameguard() middleware should be mounted correctly
   );
 ```
 
-helmet.frameguard() 'action' should be set to 'DENY'
+helmet.frameguard() 'action' 應該設置爲 “DENY”
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
index 298aac04f0..7c30c0ca26 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
@@ -1,7 +1,7 @@
 ---
 id: 587d8247367417b2b2512c39
 title: >-
-  Mitigate the Risk of Cross Site Scripting (XSS) Attacks with helmet.xssFilter()
+  使用 helmet.xssFilter() 降低跨站點腳本（XSS）攻擊的風險
 challengeType: 2
 forumTopicId: 301583
 dashedName: mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet-xssfilter
@@ -9,23 +9,23 @@ dashedName: mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet-xs
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+請注意，本項目在 [這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec) 的基礎上進行開發。你也可以從 [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.
+跨站腳本（XSS）是一種常見的攻擊類型，惡意腳本被注入到易受攻擊的頁面，目的是竊取敏感數據，如會話 cookies 或密碼。
 
-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;, >.
+降低 XSS 攻擊風險的基本規則很簡單："永遠不要相信用戶的輸入"。 作爲一個開發者，你應該始終對所有來自外部的輸入進行消毒。 這包括來自表單、GET 查詢URL，甚至來自 POST 請求體的數據。 淨化意味着你應該找到並編碼可能有危險的字符，例如 &lt;, >。
 
-Modern browsers can help mitigating the risk by adopting better software strategies. Often these are configurable via http headers.
+現代瀏覽器通過採用更好的軟件策略來幫助降低風險。 通常情況下，這些都是可以通過 http 頭文件來配置的。
 
-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.
+X-XSS-Protection HTTP 消息頭是一種基本的保護。 瀏覽器使用啓發式過濾器檢測潛在的注入腳本。 如果請求頭被啓用，瀏覽器會改變腳本代碼，使其失效。 它得到的支持仍然有限。
 
 # --instructions--
 
-Use `helmet.xssFilter()` to sanitize input sent to your server.
+使用 `helmet.xssFilter()` 來淨化發送到服務器的輸入。
 
 # --hints--
 
-helmet.xssFilter() middleware should be mounted correctly
+helmet.xssFilter() 中間件應正確安裝。
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
index 1a05e0ba5c..fd2c561606 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8248367417b2b2512c3b
-title: Prevent IE from Opening Untrusted HTML with helmet.ieNoOpen()
+title: 使用 helment.ieNoOpen() 防止 IE 打開不受信任的 HTML
 challengeType: 2
 forumTopicId: 301584
 dashedName: prevent-ie-from-opening-untrusted-html-with-helmet-ienoopen
@@ -8,17 +8,17 @@ 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 [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。 你也可以從[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.
+有些網站會下載不安全的 HTML 文件。 某些版本的 IE 默認情況下還會在你網站的作用域下打開這些 HTML 文件。 換句話說，這些不安全的 HTML 頁面可以在你的網站做惡意行爲。 我們可以通過中間件來設置 header 中的 X-Download-Options 字段，讓它的值爲 noopen。 這樣就可以防止 IE 在不信任的網站下執行下載的文件。
 
 # --instructions--
 
-Use the `helmet.ieNoOpen()` method on your server.
+應正確加載 `helmet.ieNoOpen()` 中間件
 
 # --hints--
 
-helmet.ieNoOpen() middleware should be mounted correctly
+helmet.ieNoOpen() 中間件應正確安裝。
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
index 72aae680a9..6e439ee8d3 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8249367417b2b2512c3f
-title: Set a Content Security Policy with helmet.contentSecurityPolicy()
+title: 使用 helment.contentSecurityPolicy() 設置內容安全策略
 challengeType: 2
 forumTopicId: 301585
 dashedName: set-a-content-security-policy-with-helmet-contentsecuritypolicy
@@ -8,21 +8,21 @@ dashedName: set-a-content-security-policy-with-helmet-contentsecuritypolicy
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+請注意，本項目在 [這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec) 的基礎上進行開發。你也可以從 [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.
+在這個挑戰中，我們要重點討論現代瀏覽器中一種能有效減輕安全風險和防禦很多種類型常見攻擊的安全防護。 通過設置和配置內容安全策略，你可以防止在頁面中無意中注入任何內容。 這會讓你的應用遠離 XSS 漏洞、惡意追蹤、惡意 frames 和很多其他攻擊。 CSP 通過配置資源白名單來避免這些問題。 你可以給任何一種類型的頁面資源（腳本、樣式文件、字體、frames、媒體文件等）做這個配置。 它支持很多指令，所以網站管理員可以做細緻的控制。 更多詳情請參考 HTML 5 Rocks 和 KeyCDN。 不幸的是，一些舊的瀏覽器不支持 CSP。
 
-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.
+默認的指令很容易受到攻擊, 所以設置 defaultSrc 指令作爲降級方案很重要。 Helmet 同時支持 defaultSrc 和 default-src 命名規範。 降級方案可以應用在大部分指令上。
 
 # --instructions--
 
-In this exercise, use `helmet.contentSecurityPolicy()`, and configure it setting the `defaultSrc directive` to `["self"]` (the list of allowed sources must be in an array), in order to trust only your website address by default. Set also the `scriptSrc` directive so that you will allow scripts to be downloaded from your website, and from the domain 'trusted-cdn.com'.
+在這個練習中，使用 `helmet.contentSecurityPolicy()`。 通過添加一個 `directives` 對象來配置它。 在該對象中，將 `defaultSrc` 設置爲 `["'self'"]`（允許的來源列表必須是一個數組），以便默認只信任你的網站地址。 同時設置 `scriptSrc` 指令，以便你只允許從你的網站（`'self'`）和域名 `'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.
+提示：在 `'self'` 關鍵詞中，單引號也是關鍵詞的一部分，所以你應該用雙引號來包起它才能正常工作。
 
 # --hints--
 
-helmet.csp() middleware should be mounted correctly
+應正確安裝 helmet.contentSecurityPolicy() 中間件。
 
 ```js
 (getUserInput) =>
@@ -36,7 +36,7 @@ helmet.csp() middleware should be mounted correctly
   );
 ```
 
-Your csp config is not correct. defaultSrc should be ["'self'"] and scriptSrc should be ["'self'", 'trusted-cdn.com']
+你的 csp 配置不正確。 defaultSrc 應爲 ["'self'"]，並且 scriptSrc 應爲 ["'self'", 'trusted-cdn.com']
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
index 6828dbe0f0..b3227a1c5a 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
@@ -1,6 +1,6 @@
 ---
 id: 58a25bcef9fc0f352b528e7c
-title: Understand BCrypt Hashes
+title: 瞭解 BCrypt 的哈希加密
 challengeType: 2
 forumTopicId: 301586
 dashedName: understand-bcrypt-hashes
@@ -8,23 +8,23 @@ 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 [Repl.it](https://repl.it/github/freeCodeCamp/boilerplate-bcrypt), or clone it from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+在下面的挑戰中，你將啓動一個新的項目，這個項目與之前的項目不同。 你可以在 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt)上找到新的啓動項目，或者從 [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 哈希值是非常安全的。 哈希值基本上是原始數據的指紋，總是唯一的。 這是通過將原始數據輸入一個算法並返回一個固定長度的結果來實現的。 爲了使這一過程更加複雜和安全，你還可以向你的哈希值 *加鹽*。 對你的散列加鹽處理包含了在散列過程之前向原始數據添加隨機數據，這使得破解散列更加困難。
 
-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!
+BCrypt 哈希值總是看起來有像`$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` 的結構。 它遵循固定的結構，第一小節 `$2a` 說明了該哈希採用什麼算法。 接下來的部分 `$13` 定義了 *成本*。 成本是指計算哈希值需要多少能量。 它在 2^cost 的對數尺度上，決定了數據要通過散列算法計算多少次。 例如，當 cost 爲 10 時，你能夠在普通計算機上每秒散列 10 個密碼，然而當 cost 爲 15 時，每次散列需要 3 秒...... 進一步說，當 cost 爲 31 時，完成一次散列需要好幾天。 通常 cost 爲 12 的哈希運算就已經足夠安全。 哈希結果的最後一部分 `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` 看起來像是由隨機數字、點和字母組成的字符串，但實際上它有兩部分內容。 前面 22 個字符是加入的鹽，剩下的就是加密過的密碼！
 
 # --instructions--
 
-To begin using BCrypt, add it as a dependency in your project and require it as 'bcrypt' in your server.
+要開始使用 BCrypt，只需將它添加到你的依賴列表，然後在你的服務器引入 “bcrypt”。
 
-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.
+在 `server.js` 文件中加入這些課程的所有代碼，放在我們提供的代碼之間。 不要改變或刪除我們爲你添加的代碼。
 
-Submit your page when you think you've got it right.
+請在完成挑戰後提交你的頁面。
 
 # --hints--
 
-BCrypt should be a dependency.
+BCrypt 應該是一個依賴項。
 
 ```js
 (getUserInput) =>
@@ -43,7 +43,7 @@ BCrypt should be a dependency.
   );
 ```
 
-BCrypt should be properly required.
+應正確引入 BCrypt。
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md
index a808410376..3c1523b777 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md
@@ -1,6 +1,6 @@
 ---
 id: 5ea9997bbec2e9bc47e94db0
-title: Creating a TCP Client
+title: 創建一個 TCP 客戶端
 challengeType: 11
 videoId: ugYfJNTawks
 dashedName: creating-a-tcp-client
@@ -10,7 +10,7 @@ dashedName: creating-a-tcp-client
 
 ## --text--
 
-Which socket object method lets you set the maximum amount of data your client accepts at once?
+哪種套接字對象方法讓你設置客戶端一次接受的最大數據量？
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
index 88f5f3fcfe..cea7adaa4e 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
@@ -1,6 +1,6 @@
 ---
 id: 5ea9997bbec2e9bc47e94db3
-title: Developing a Banner Grabber
+title: 開發橫幅抓取器
 challengeType: 11
 videoId: CeGW761BIsA
 dashedName: developing-a-banner-grabber
@@ -10,7 +10,7 @@ dashedName: developing-a-banner-grabber
 
 ## --text--
 
-Fill in the blanks to complete the `banner` function below:
+填寫空格以完成下面的 `banner` 函數：
 
 ```py
 def banner(ip, port):
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md
index a35002583e..02dc191458 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md
@@ -1,6 +1,6 @@
 ---
 id: 5ea9997bbec2e9bc47e94db4
-title: Developing a Port Scanner
+title: 開發一個端口掃描器
 challengeType: 11
 videoId: z_qkqZS7KZ4
 dashedName: developing-a-port-scanner
@@ -10,19 +10,19 @@ dashedName: developing-a-port-scanner
 
 ## --text--
 
-What is the main difference between the `.connect()` and `.connect_ex()` methods?
+`.connect()` 和 `.connect_ex()` 方法的主要區別是什麼？
 
 ## --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.
+如果有錯誤或沒有找到主機，`.connect()` 返回一個錯誤代碼，而 `.connect_ex()` 則引發一個異常。
 
 ---
 
-If there is an error or if no host is found, `.connect()` raises an exception while `.connect_ex()` returns an error code.
+如果有錯誤或沒有找到主機，`.connect()` 會引發一個異常，而 `.connect_ex()` 會返回一個錯誤代碼。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md
index 8f26492699..67e94737fe 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md
@@ -1,6 +1,6 @@
 ---
 id: 5ea9997bbec2e9bc47e94db1
-title: Developing an Nmap Scanner part 1
+title: 開發 Nmap 掃描器 第一部分
 challengeType: 11
 videoId: jYk9XaGoAnk
 dashedName: developing-an-nmap-scanner-part-1
@@ -10,7 +10,7 @@ dashedName: developing-an-nmap-scanner-part-1
 
 ## --text--
 
-What is the correct command to install the Python 3 version of the `python-nmap` library?
+安裝 Python 3 版本的 `python-nmap` 庫的正確命令是什麼？
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md
index ab3a65968f..64dbf0ee3c 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md
@@ -1,6 +1,6 @@
 ---
 id: 5ea9997bbec2e9bc47e94db2
-title: Developing an Nmap Scanner part 2
+title: 開發 Nmap 掃描器 第二部分
 challengeType: 11
 videoId: a98PscnUsTg
 dashedName: developing-an-nmap-scanner-part-2
@@ -10,7 +10,7 @@ dashedName: developing-an-nmap-scanner-part-2
 
 ## --text--
 
-Which of the following allows you to scan for UDP ports between 21 to 443?
+以下哪項允許你掃描 21 至 443 之間的 UDP 端口？
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/introduction-and-setup.md b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/introduction-and-setup.md
index c243ea2954..62068e39d2 100644
--- a/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/introduction-and-setup.md
+++ b/curriculum/challenges/chinese-traditional/09-information-security/python-for-penetration-testing/introduction-and-setup.md
@@ -1,6 +1,6 @@
 ---
 id: 5ea9997bbec2e9bc47e94dae
-title: Introduction and Setup
+title: 介紹和安裝
 challengeType: 11
 videoId: XeQ7ZKtb998
 dashedName: introduction-and-setup
@@ -10,19 +10,19 @@ dashedName: introduction-and-setup
 
 ## --text--
 
-What code editor and extension does the instructor recommend for developing penetration testing tools in Python?
+講師推薦什麼代碼編輯器和擴展來開發 Python 的滲透測試工具？
 
 ## --answers--
 
-Atom and the atom-python-run extension.
+Atom和atom-python-run 擴展
 
 ---
 
-VSCode and Microsoft's Python extension.
+VSCode 和微軟的 Python 擴展
 
 ---
 
-Sublime Text and the Anaconda package.
+Sublime Text 和 Anaconda 軟件包
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-hash-table.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-hash-table.md
index 65b6890432..a33c3d5178 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-hash-table.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-hash-table.md
@@ -20,6 +20,8 @@ Let's create the basic functionality of a hash table. We've created a naive hash
 
 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.
@@ -50,20 +52,6 @@ assert(
 );
 ```
 
-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 HashTable should have a lookup method.
 
 ```js
@@ -78,6 +66,20 @@ assert(
 );
 ```
 
+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
@@ -103,14 +105,40 @@ assert(
     if (typeof HashTable !== 'undefined') {
       test = new HashTable();
     }
-    test.add = addMethodSolution;
     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
@@ -165,14 +193,6 @@ var hash = string => {
   }
   return hash;
 };
-
-var addMethodSolution = function(key, val) {
-    var theHash = hash(key);
-    if (!this.collection.hasOwnProperty(theHash)) {
-      this.collection[theHash] = {};
-    }
-    this.collection[theHash][key] = val;
-}
 ```
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md
index f7f70a8b32..c381e3940b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md
@@ -12,11 +12,15 @@ In this challenge you will be creating a Priority Queue. A Priority Queue is a s
 
 For instance, let’s imagine we have a priority queue with three items:
 
-`[['kitten', 2], ['dog', 2], ['rabbit', 2]]`
+```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:
 
-`[['human', 1], ['kitten', 2], ['dog', 2], ['rabbit', 2]]`.
+```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.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-stack-class.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-stack-class.md
index a26dec74f6..c4a493c439 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-stack-class.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-stack-class.md
@@ -77,8 +77,9 @@ The `peek` method should return the top element of the stack
 assert(
   (function () {
     var test = new Stack();
+    test.push('CS61');
     test.push('CS50');
-    return test.peek() === 'CS50';
+    return test.peek() === 'CS50' && test.peek() === 'CS50';
   })()
 );
 ```
@@ -89,8 +90,9 @@ The `pop` method should remove and return the top element of the stack
 assert(
   (function () {
     var test = new Stack();
+    test.push('CS61');
     test.push('CS50');
-    return test.pop() === 'CS50';
+    return test.pop() === 'CS50' && test.pop() === 'CS61';
   })()
 );
 ```
@@ -112,6 +114,7 @@ The `clear` method should remove all element from the stack
 assert(
   (function () {
     var test = new Stack();
+    test.push('CS61');
     test.push('CS50');
     test.clear();
     return test.isEmpty();
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
index 96746bab11..7e6822ef67 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
@@ -31,7 +31,9 @@ assert(myMap.get('freeCodeCamp') === 'Awesome!');
 # --seed--
 
 ## --seed-contents--
+
 ```js
+
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md
index 0f6b957518..1727a24ed0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md
@@ -12,15 +12,21 @@ Now that you have worked through ES5, you are going to perform something similar
 
 To create a new empty set:
 
-`var set = new Set();`
+```js
+var set = new Set();
+```
 
 You can create a set with a value:
 
-`var set = new Set(1);`
+```js
+var set = new Set(1);
+```
 
 You can create a set with an array:
 
-`var set = new Set([1, 2, 3]);`
+```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:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
index 2d20974121..e20657a87c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
@@ -14,13 +14,17 @@ While binary heaps may be implemented as tree structures with nodes that contain
 
 For instance, consider this array representation of a binary min heap:
 
-`[ 6, 22, 30, 37, 63, 48, 42, 76 ]`
+```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:
 
-`[ null, 6, 22, 30, 37, 63, 48, 42, 76 ]`
+```js
+[ null, 6, 22, 30, 37, 63, 48, 42, 76 ]
+```
 
 An element's left child: `i * 2`
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md
index a3c2f3b97e..c958d1922c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md
@@ -12,7 +12,9 @@ Let's practice removing items from an ES6 Set using the `delete` method.
 
 First, create an ES6 Set:
 
-`var set = new Set([1,2,3]);`
+```js
+var set = new Set([1,2,3]);
+```
 
 Now remove an item from your Set with the `delete` method.
 
@@ -46,8 +48,11 @@ assert(
 
 ```js
 function checkSet(){
-   var set = null;
-   return set;
+  // Only change code below this line
+  var set = null;
+
+  // Only change code above this line
+  return set;   
 }
 ```
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/typed-arrays.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/typed-arrays.md
index 2433c0e2be..b992af729a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/typed-arrays.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/typed-arrays.md
@@ -10,7 +10,9 @@ dashedName: typed-arrays
 
 Arrays are JavaScript objects that can hold a lot of different elements.
 
-`var complexArr = [1, 5, "2", "Word", {"name": "James"}];`
+```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.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md
index 63c09ecd32..55d4ac67de 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md
@@ -12,15 +12,21 @@ Let's look at the .has and .size methods available on the ES6 Set object.
 
 First, create an ES6 Set
 
-`var set = new Set([1,2,3]);`
+```js
+var set = new Set([1,2,3]);
+```
 
 The .has method will check if the value is contained within the set.
 
-`var hasTwo = set.has(2);`
+```js
+var hasTwo = set.has(2);
+```
 
 The .size method will return an integer representing the size of the Set
 
-`var howBig = set.size;`
+```js
+var howBig = set.size;
+```
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
index 7a5d2fd453..1d44675e28 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
@@ -8,24 +8,50 @@ dashedName: problem-100-arranged-probability
 
 # --description--
 
-If a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and two discs were taken at random, it can be seen that the probability of taking two blue discs, P(BB) = (15/21)×(14/20) = 1/2.
+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.
 
-The next such arrangement, for which there is exactly 50% chance of taking two blue discs at random, is a box containing eighty-five blue discs and thirty-five red discs.
+$${P(BB)} = \frac{15}{21}×\frac{14}{20} = \frac{1}{2}$$
 
-By finding the first arrangement to contain over 10<sup>12</sup> = 1,000,000,000,000 discs in total, determine the number of blue discs that the box would contain.
+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()` should return a number.
+`arrangedProbability(20)` should return a number.
 
 ```js
-assert(typeof arrangedProbability() === 'number');
+assert(typeof arrangedProbability(10) === 'number');
 ```
 
-`arrangedProbability()` should return 756872327473.
+`arrangedProbability(20)` should return `15`.
 
 ```js
-assert.strictEqual(arrangedProbability(), 756872327473);
+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--
@@ -33,16 +59,29 @@ assert.strictEqual(arrangedProbability(), 756872327473);
 ## --seed-contents--
 
 ```js
-function arrangedProbability() {
+function arrangedProbability(limit) {
 
   return true;
 }
 
-arrangedProbability();
+arrangedProbability(20);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
index 7573114475..cd51f0f2ec 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
@@ -10,26 +10,30 @@ dashedName: problem-101-optimum-polynomial
 
 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, ...
+As an example, let us consider the sequence of cube numbers. This is defined by the generating function, $u_n = n^3: 1, 8, 27, 64, 125, 216, \ldots$
 
 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).
+We shall define $OP(k, n)$ to be the $n^{th}$ 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.
+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) = u_1$.
 
 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, ...
+$$\begin{array}{ll} OP(1, n) = 1          & 1, {\color{red}1}, 1, 1, \ldots     \\\\ OP(2, n) = 7n−6       & 1, 8, {\color{red}{15}}, \ldots     \\\\ OP(3, n) = 6n^2−11n+6 & 1, 8, 27, {\color{red}{58}}, \ldots \\\\ OP(4, n) = n^3        & 1, 8, 27, 64, 125, \ldots \end{array}$$
 
-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.
+Clearly no BOPs exist for k ≥ 4. By considering the sum of FITs generated by the BOPs (indicated in $\color{red}{red}$ above), we obtain 1 + 15 + 58 = 74. Consider the following tenth degree polynomial generating function:
+
+$$u_n = 1 − n + n^2 − n^3 + n^4 − n^5 + n^6 − n^7 + n^8 − n^9 + n^{10}$$
+
+Find the sum of FITs for the BOPs.
 
 # --hints--
 
-`euler101()` should return 37076114526.
+`optimumPolynomial()` should return `37076114526`.
 
 ```js
-assert.strictEqual(euler101(), 37076114526);
+assert.strictEqual(optimumPolynomial(), 37076114526);
 ```
 
 # --seed--
@@ -37,12 +41,12 @@ assert.strictEqual(euler101(), 37076114526);
 ## --seed-contents--
 
 ```js
-function euler101() {
+function optimumPolynomial() {
 
   return true;
 }
 
-euler101();
+optimumPolynomial();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
index 3f11a537f1..9705afbc6f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
@@ -12,39 +12,145 @@ Three distinct points are plotted at random on a Cartesian plane, for which -100
 
 Consider the following two triangles:
 
-A(-340,495), B(-153,-910), C(835,-947)
+```js
+const exampleTriangles = [
+  [[-340, 495], [-153, -910], [835, -947]],
+  [[-175, 41], [-421, -714], [574, -645]]
+];
+```
 
-X(-175,41), Y(-421,-714), Z(574,-645)
+It can be verified that first triangle contains the origin, whereas second triangle does not.
 
-It can be verified that triangle ABC contains the origin, whereas triangle XYZ does not.
-
-Using triangles.txt (right click and 'Save Link/Target As...'), a 27K text file containing the coordinates of one thousand "random" triangles, find the number of triangles for which the interior contains the origin.
-
-NOTE: The first two examples in the file represent the triangles in the example given above.
+Using the `triangles` array containing coordinates of triangles, find the number of triangles for which the interior contains the origin.
 
 # --hints--
 
-`euler102()` should return 228.
+`triangleContainment(exampleTriangles)` should return a number.
 
 ```js
-assert.strictEqual(euler102(), 228);
+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 euler102() {
+function triangleContainment(triangles) {
 
   return true;
 }
 
-euler102();
+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
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
index 1ba5808084..677153bd67 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
@@ -8,30 +8,29 @@ 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:
+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.
+1. $S(B) ≠ S(C)$; that is, sums of subsets cannot be equal.
+2. If B contains more elements than C then $S(B) > S(C)$.
 
-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.
 
-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.
+$$\begin{align} & 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\\} \\\\ \end{align}$$
 
-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 = \\{a_1, a_2, \ldots, a_n\\}$, the next optimum set is of the form $B = \\{b, a_1 + b, a_2 + b, \ldots, a_n + b\\}$, where b is the "middle" element on the previous row.
 
-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`.
 
-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.
 
-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.
+**Note:** This problem is related to Problem 105 and Problem 106.
 
 # --hints--
 
-`euler103()` should return 20313839404245.
+`optimumSpecialSumSet()` should return the string `20313839404245`.
 
 ```js
-assert.strictEqual(euler103(), 20313839404245);
+assert.strictEqual(optimumSpecialSumSet(), '20313839404245');
 ```
 
 # --seed--
@@ -39,12 +38,12 @@ assert.strictEqual(euler103(), 20313839404245);
 ## --seed-contents--
 
 ```js
-function euler103() {
+function optimumSpecialSumSet() {
 
   return true;
 }
 
-euler103();
+optimumSpecialSumSet();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
index 625840f94a..1c61ea7c2e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
@@ -10,18 +10,18 @@ dashedName: problem-104-pandigital-fibonacci-ends
 
 The Fibonacci sequence is defined by the recurrence relation:
 
-Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
+$F_n = F_{n − 1} + F_{n − 2}$, where $F_1 = 1$ and $F_2 = 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.
+It turns out that $F_{541}$, 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 $F_{2749}$, 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.
+Given that $F_k$ 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.
+`pandigitalFibonacciEnds()` should return `329468`.
 
 ```js
-assert.strictEqual(euler104(), 329468);
+assert.strictEqual(pandigitalFibonacciEnds(), 329468);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler104(), 329468);
 ## --seed-contents--
 
 ```js
-function euler104() {
+function pandigitalFibonacciEnds() {
 
   return true;
 }
 
-euler104();
+pandigitalFibonacciEnds();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
index 28d4d6ac86..0a5d611f90 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
@@ -8,37 +8,48 @@ 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:
+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.
+1. $S(B) ≠ S(C)$; that is, sums of subsets cannot be equal.
+2. If B contains more elements than C then $S(B) > S(C)$.
 
-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$.
 
-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`, an array with one-hundred sets, containing seven to twelve elements (the two examples given above are the first two sets), identify all the special sum sets, $A_1, A_2, \ldots, A_k$, and find the value of $(A_1) + S(A_2) + \cdots + S(A_k)$.
 
-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.
+**Note:** This problem is related to Problem 103 and Problem 106.
 
 # --hints--
 
-`euler105()` should return 73702.
+`testingSpecialSubsetSums(testSets)` should return `73702`.
 
 ```js
-assert.strictEqual(euler105(), 73702);
+assert.strictEqual(testingSpecialSubsetSums(_testSets), 73702);
 ```
 
 # --seed--
 
+## --after-user-code--
+
+```js
+const _testSets = [
+  [81,88,75,42,87,84,86,65],[157,150,164,119,79,159,161,139,158],[673,465,569,603,629,592,584,300,601,599,600],[90,85,83,84,65,87,76,46],[165,168,169,190,162,85,176,167,127],[224,275,278,249,277,279,289,295,139],[354,370,362,384,359,324,360,180,350,270],[599,595,557,298,448,596,577,667,597,588,602],[175,199,137,88,187,173,168,171,174],[93,187,196,144,185,178,186,202,182],[157,155,81,158,119,176,152,167,159],[184,165,159,166,163,167,174,124,83],[1211,1212,1287,605,1208,1189,1060,1216,1243,1200,908,1210],[339,299,153,305,282,304,313,306,302,228],[94,104,63,112,80,84,93,96],[41,88,82,85,61,74,83,81],[90,67,84,83,82,97,86,41],[299,303,151,301,291,302,307,377,333,280],[55,40,48,44,25,42,41],[1038,1188,1255,1184,594,890,1173,1151,1186,1203,1187,1195],[76,132,133,144,135,99,128,154],[77,46,108,81,85,84,93,83],[624,596,391,605,529,610,607,568,604,603,453],[83,167,166,189,163,174,160,165,133],[308,281,389,292,346,303,302,304,300,173],[593,1151,1187,1184,890,1040,1173,1186,1195,1255,1188,1203],[68,46,64,33,60,58,65],[65,43,88,87,86,99,93,90],[83,78,107,48,84,87,96,85],[1188,1173,1256,1038,1187,1151,890,1186,1184,1203,594,1195],[302,324,280,296,294,160,367,298,264,299],[521,760,682,687,646,664,342,698,692,686,672],[56,95,86,97,96,89,108,120],[344,356,262,343,340,382,337,175,361,330],[47,44,42,27,41,40,37],[139,155,161,158,118,166,154,156,78],[118,157,164,158,161,79,139,150,159],[299,292,371,150,300,301,281,303,306,262],[85,77,86,84,44,88,91,67],[88,85,84,44,65,91,76,86],[138,141,127,96,136,154,135,76],[292,308,302,346,300,324,304,305,238,166],[354,342,341,257,348,343,345,321,170,301],[84,178,168,167,131,170,193,166,162],[686,701,706,673,694,687,652,343,683,606,518],[295,293,301,367,296,279,297,263,323,159],[1038,1184,593,890,1188,1173,1187,1186,1195,1150,1203,1255],[343,364,388,402,191,383,382,385,288,374],[1187,1036,1183,591,1184,1175,888,1197,1182,1219,1115,1167],[151,291,307,303,345,238,299,323,301,302],[140,151,143,138,99,69,131,137],[29,44,42,59,41,36,40],[348,329,343,344,338,315,169,359,375,271],[48,39,34,37,50,40,41],[593,445,595,558,662,602,591,297,610,580,594],[686,651,681,342,541,687,691,707,604,675,699],[180,99,189,166,194,188,144,187,199],[321,349,335,343,377,176,265,356,344,332],[1151,1255,1195,1173,1184,1186,1188,1187,1203,593,1038,891],[90,88,100,83,62,113,80,89],[308,303,238,300,151,304,324,293,346,302],[59,38,50,41,42,35,40],[352,366,174,355,344,265,343,310,338,331],[91,89,93,90,117,85,60,106],[146,186,166,175,202,92,184,183,189],[82,67,96,44,80,79,88,76],[54,50,58,66,31,61,64],[343,266,344,172,308,336,364,350,359,333],[88,49,87,82,90,98,86,115],[20,47,49,51,54,48,40],[159,79,177,158,157,152,155,167,118],[1219,1183,1182,1115,1035,1186,591,1197,1167,887,1184,1175],[611,518,693,343,704,667,686,682,677,687,725],[607,599,634,305,677,604,603,580,452,605,591],[682,686,635,675,692,730,687,342,517,658,695],[662,296,573,598,592,584,553,593,595,443,591],[180,185,186,199,187,210,93,177,149],[197,136,179,185,156,182,180,178,99],[271,298,218,279,285,282,280,238,140],[1187,1151,890,593,1194,1188,1184,1173,1038,1186,1255,1203],[169,161,177,192,130,165,84,167,168],[50,42,43,41,66,39,36],[590,669,604,579,448,599,560,299,601,597,598],[174,191,206,179,184,142,177,180,90],[298,299,297,306,164,285,374,269,329,295],[181,172,162,138,170,195,86,169,168],[1184,1197,591,1182,1186,889,1167,1219,1183,1033,1115,1175],[644,695,691,679,667,687,340,681,770,686,517],[606,524,592,576,628,593,591,584,296,444,595],[94,127,154,138,135,74,136,141],[179,168,172,178,177,89,198,186,137],[302,299,291,300,298,149,260,305,280,370],[678,517,670,686,682,768,687,648,342,692,702],[302,290,304,376,333,303,306,298,279,153],[95,102,109,54,96,75,85,97],[150,154,146,78,152,151,162,173,119],[150,143,157,152,184,112,154,151,132],[36,41,54,40,25,44,42],[37,48,34,59,39,41,40],[681,603,638,611,584,303,454,607,606,605,596]
+];
+```
+
 ## --seed-contents--
 
 ```js
-function euler105() {
+function testingSpecialSubsetSums(sets) {
 
   return true;
 }
 
-euler105();
+const testSets = [
+  [81,88,75,42,87,84,86,65],[157,150,164,119,79,159,161,139,158],[673,465,569,603,629,592,584,300,601,599,600],[90,85,83,84,65,87,76,46],[165,168,169,190,162,85,176,167,127],[224,275,278,249,277,279,289,295,139],[354,370,362,384,359,324,360,180,350,270],[599,595,557,298,448,596,577,667,597,588,602],[175,199,137,88,187,173,168,171,174],[93,187,196,144,185,178,186,202,182],[157,155,81,158,119,176,152,167,159],[184,165,159,166,163,167,174,124,83],[1211,1212,1287,605,1208,1189,1060,1216,1243,1200,908,1210],[339,299,153,305,282,304,313,306,302,228],[94,104,63,112,80,84,93,96],[41,88,82,85,61,74,83,81],[90,67,84,83,82,97,86,41],[299,303,151,301,291,302,307,377,333,280],[55,40,48,44,25,42,41],[1038,1188,1255,1184,594,890,1173,1151,1186,1203,1187,1195],[76,132,133,144,135,99,128,154],[77,46,108,81,85,84,93,83],[624,596,391,605,529,610,607,568,604,603,453],[83,167,166,189,163,174,160,165,133],[308,281,389,292,346,303,302,304,300,173],[593,1151,1187,1184,890,1040,1173,1186,1195,1255,1188,1203],[68,46,64,33,60,58,65],[65,43,88,87,86,99,93,90],[83,78,107,48,84,87,96,85],[1188,1173,1256,1038,1187,1151,890,1186,1184,1203,594,1195],[302,324,280,296,294,160,367,298,264,299],[521,760,682,687,646,664,342,698,692,686,672],[56,95,86,97,96,89,108,120],[344,356,262,343,340,382,337,175,361,330],[47,44,42,27,41,40,37],[139,155,161,158,118,166,154,156,78],[118,157,164,158,161,79,139,150,159],[299,292,371,150,300,301,281,303,306,262],[85,77,86,84,44,88,91,67],[88,85,84,44,65,91,76,86],[138,141,127,96,136,154,135,76],[292,308,302,346,300,324,304,305,238,166],[354,342,341,257,348,343,345,321,170,301],[84,178,168,167,131,170,193,166,162],[686,701,706,673,694,687,652,343,683,606,518],[295,293,301,367,296,279,297,263,323,159],[1038,1184,593,890,1188,1173,1187,1186,1195,1150,1203,1255],[343,364,388,402,191,383,382,385,288,374],[1187,1036,1183,591,1184,1175,888,1197,1182,1219,1115,1167],[151,291,307,303,345,238,299,323,301,302],[140,151,143,138,99,69,131,137],[29,44,42,59,41,36,40],[348,329,343,344,338,315,169,359,375,271],[48,39,34,37,50,40,41],[593,445,595,558,662,602,591,297,610,580,594],[686,651,681,342,541,687,691,707,604,675,699],[180,99,189,166,194,188,144,187,199],[321,349,335,343,377,176,265,356,344,332],[1151,1255,1195,1173,1184,1186,1188,1187,1203,593,1038,891],[90,88,100,83,62,113,80,89],[308,303,238,300,151,304,324,293,346,302],[59,38,50,41,42,35,40],[352,366,174,355,344,265,343,310,338,331],[91,89,93,90,117,85,60,106],[146,186,166,175,202,92,184,183,189],[82,67,96,44,80,79,88,76],[54,50,58,66,31,61,64],[343,266,344,172,308,336,364,350,359,333],[88,49,87,82,90,98,86,115],[20,47,49,51,54,48,40],[159,79,177,158,157,152,155,167,118],[1219,1183,1182,1115,1035,1186,591,1197,1167,887,1184,1175],[611,518,693,343,704,667,686,682,677,687,725],[607,599,634,305,677,604,603,580,452,605,591],[682,686,635,675,692,730,687,342,517,658,695],[662,296,573,598,592,584,553,593,595,443,591],[180,185,186,199,187,210,93,177,149],[197,136,179,185,156,182,180,178,99],[271,298,218,279,285,282,280,238,140],[1187,1151,890,593,1194,1188,1184,1173,1038,1186,1255,1203],[169,161,177,192,130,165,84,167,168],[50,42,43,41,66,39,36],[590,669,604,579,448,599,560,299,601,597,598],[174,191,206,179,184,142,177,180,90],[298,299,297,306,164,285,374,269,329,295],[181,172,162,138,170,195,86,169,168],[1184,1197,591,1182,1186,889,1167,1219,1183,1033,1115,1175],[644,695,691,679,667,687,340,681,770,686,517],[606,524,592,576,628,593,591,584,296,444,595],[94,127,154,138,135,74,136,141],[179,168,172,178,177,89,198,186,137],[302,299,291,300,298,149,260,305,280,370],[678,517,670,686,682,768,687,648,342,692,702],[302,290,304,376,333,303,306,298,279,153],[95,102,109,54,96,75,85,97],[150,154,146,78,152,151,162,173,119],[150,143,157,152,184,112,154,151,132],[36,41,54,40,25,44,42],[37,48,34,59,39,41,40],[681,603,638,611,584,303,454,607,606,605,596]
+];
+
+testingSpecialSubsetSums(testSets);
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
index bb1db2e260..e771a72835 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
@@ -8,11 +8,10 @@ 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:
+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).
+1. $S(B) ≠ S(C)$; that is, sums of subsets cannot be equal.
+2. 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.
 
@@ -20,14 +19,14 @@ Surprisingly, out of the 25 possible subset pairs that can be obtained from a se
 
 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.
+**Note:** This problem is related to Problem 103 and Problem 105.
 
 # --hints--
 
-`euler106()` should return 21384.
+`subsetSumsMetaTesting()` should return `21384`.
 
 ```js
-assert.strictEqual(euler106(), 21384);
+assert.strictEqual(subsetSumsMetaTesting(), 21384);
 ```
 
 # --seed--
@@ -35,12 +34,12 @@ assert.strictEqual(euler106(), 21384);
 ## --seed-contents--
 
 ```js
-function euler106() {
+function subsetSumsMetaTesting() {
 
   return true;
 }
 
-euler106();
+subsetSumsMetaTesting();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-107-minimal-network.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
index f51dfe801d..312e9f3312 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
@@ -10,29 +10,58 @@ dashedName: problem-107-minimal-network
 
 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.
+<img class="img-responsive center-block" alt="Network with seven vertices and twelve edges" src="https://cdn.freecodecamp.org/curriculum/project-euler/minimal-network-1.png" style="background-color: white; padding: 10px;" />
 
-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.
+The same network can be represented by the matrix below.
+
+|   | A  | B  | C  | D  | E  | F  | G  |
+| - | -- | -- | -- | -- | -- | -- | -- |
+| A | -  | 16 | 12 | 21 | -  | -  | -  |
+| B | 16 | -  | -  | 17 | 20 | -  | -  |
+| C | 12 | -  | -  | 28 | -  | 31 | -  |
+| D | 21 | 17 | 28 | -  | 18 | 19 | 23 |
+| E | -  | 20 | -  | 18 | -  | -  | 11 |
+| F | -  | -  | 31 | 19 | -  | -  | 27 |
+| G | -  | -  | -  | 23 | 11 | 27 | -  |
+
+
+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.
+
+<img class="img-responsive center-block" alt="Network wtih seven vertices and left six edges: AB, BD, CA, DE, DF, EG" src="https://cdn.freecodecamp.org/curriculum/project-euler/minimal-network-2.png" style="background-color: white; padding: 10px;" />
+
+Using `network`, an 2D array representing network in matrix form, find the maximum saving which can be achieved by removing redundant edges whilst ensuring that the network remains connected. Vertices not having connection will be represented with `-1`.
 
 # --hints--
 
-`euler107()` should return 259679.
+`minimalNetwork(testNetwork)` should return `259679`.
 
 ```js
-assert.strictEqual(euler107(), 259679);
+assert.strictEqual(minimalNetwork(_testNetwork), 259679);
 ```
 
 # --seed--
 
+## --after-user-code--
+
+```js
+const _testNetwork = [
+  [-1,-1,-1,427,668,495,377,678,-1,177,-1,-1,870,-1,869,624,300,609,131,-1,251,-1,-1,-1,856,221,514,-1,591,762,182,56,-1,884,412,273,636,-1,-1,774],[-1,-1,262,-1,-1,508,472,799,-1,956,578,363,940,143,-1,162,122,910,-1,729,802,941,922,573,531,539,667,607,-1,920,-1,-1,315,649,937,-1,185,102,636,289],[-1,262,-1,-1,926,-1,958,158,647,47,621,264,81,-1,402,813,649,386,252,391,264,637,349,-1,-1,-1,108,-1,727,225,578,699,-1,898,294,-1,575,168,432,833],[427,-1,-1,-1,366,-1,-1,635,-1,32,962,468,893,854,718,427,448,916,258,-1,760,909,529,311,404,-1,-1,588,680,875,-1,615,-1,409,758,221,-1,-1,76,257],[668,-1,926,366,-1,-1,-1,250,268,-1,503,944,-1,677,-1,727,793,457,981,191,-1,-1,-1,351,969,925,987,328,282,589,-1,873,477,-1,-1,19,450,-1,-1,-1],[495,508,-1,-1,-1,-1,-1,765,711,819,305,302,926,-1,-1,582,-1,861,-1,683,293,-1,-1,66,-1,27,-1,-1,290,-1,786,-1,554,817,33,-1,54,506,386,381],[377,472,958,-1,-1,-1,-1,-1,-1,120,42,-1,134,219,457,639,538,374,-1,-1,-1,966,-1,-1,-1,-1,-1,449,120,797,358,232,550,-1,305,997,662,744,686,239],[678,799,158,635,250,765,-1,-1,-1,35,-1,106,385,652,160,-1,890,812,605,953,-1,-1,-1,79,-1,712,613,312,452,-1,978,900,-1,901,-1,-1,225,533,770,722],[-1,-1,647,-1,268,711,-1,-1,-1,283,-1,172,-1,663,236,36,403,286,986,-1,-1,810,761,574,53,793,-1,-1,777,330,936,883,286,-1,174,-1,-1,-1,828,711],[177,956,47,32,-1,819,120,35,283,-1,50,-1,565,36,767,684,344,489,565,-1,-1,103,810,463,733,665,494,644,863,25,385,-1,342,470,-1,-1,-1,730,582,468],[-1,578,621,962,503,305,42,-1,-1,50,-1,155,519,-1,-1,256,990,801,154,53,474,650,402,-1,-1,-1,966,-1,-1,406,989,772,932,7,-1,823,391,-1,-1,933],[-1,363,264,468,944,302,-1,106,172,-1,155,-1,-1,-1,380,438,-1,41,266,-1,-1,104,867,609,-1,270,861,-1,-1,165,-1,675,250,686,995,366,191,-1,433,-1],[870,940,81,893,-1,926,134,385,-1,565,519,-1,-1,313,851,-1,-1,-1,248,220,-1,826,359,829,-1,234,198,145,409,68,359,-1,814,218,186,-1,-1,929,203,-1],[-1,143,-1,854,677,-1,219,652,663,36,-1,-1,313,-1,132,-1,433,598,-1,-1,168,870,-1,-1,-1,128,437,-1,383,364,966,227,-1,-1,807,993,-1,-1,526,17],[869,-1,402,718,-1,-1,457,160,236,767,-1,380,851,132,-1,-1,596,903,613,730,-1,261,-1,142,379,885,89,-1,848,258,112,-1,900,-1,-1,818,639,268,600,-1],[624,162,813,427,727,582,639,-1,36,684,256,438,-1,-1,-1,-1,539,379,664,561,542,-1,999,585,-1,-1,321,398,-1,-1,950,68,193,-1,697,-1,390,588,848,-1],[300,122,649,448,793,-1,538,890,403,344,990,-1,-1,433,596,539,-1,-1,73,-1,318,-1,-1,500,-1,968,-1,291,-1,-1,765,196,504,757,-1,542,-1,395,227,148],[609,910,386,916,457,861,374,812,286,489,801,41,-1,598,903,379,-1,-1,-1,946,136,399,-1,941,707,156,757,258,251,-1,807,-1,-1,-1,461,501,-1,-1,616,-1],[131,-1,252,258,981,-1,-1,605,986,565,154,266,248,-1,613,664,73,-1,-1,686,-1,-1,575,627,817,282,-1,698,398,222,-1,649,-1,-1,-1,-1,-1,654,-1,-1],[-1,729,391,-1,191,683,-1,953,-1,-1,53,-1,220,-1,730,561,-1,946,686,-1,-1,389,729,553,304,703,455,857,260,-1,991,182,351,477,867,-1,-1,889,217,853],[251,802,264,760,-1,293,-1,-1,-1,-1,474,-1,-1,168,-1,542,318,136,-1,-1,-1,-1,392,-1,-1,-1,267,407,27,651,80,927,-1,974,977,-1,-1,457,117,-1],[-1,941,637,909,-1,-1,966,-1,810,103,650,104,826,870,261,-1,-1,399,-1,389,-1,-1,-1,202,-1,-1,-1,-1,867,140,403,962,785,-1,511,-1,1,-1,707,-1],[-1,922,349,529,-1,-1,-1,-1,761,810,402,867,359,-1,-1,999,-1,-1,575,729,392,-1,-1,388,939,-1,959,-1,83,463,361,-1,-1,512,931,-1,224,690,369,-1],[-1,573,-1,311,351,66,-1,79,574,463,-1,609,829,-1,142,585,500,941,627,553,-1,202,388,-1,164,829,-1,620,523,639,936,-1,-1,490,-1,695,-1,505,109,-1],[856,531,-1,404,969,-1,-1,-1,53,733,-1,-1,-1,-1,379,-1,-1,707,817,304,-1,-1,939,164,-1,-1,616,716,728,-1,889,349,-1,963,150,447,-1,292,586,264],[221,539,-1,-1,925,27,-1,712,793,665,-1,270,234,128,885,-1,968,156,282,703,-1,-1,-1,829,-1,-1,-1,822,-1,-1,-1,736,576,-1,697,946,443,-1,205,194],[514,667,108,-1,987,-1,-1,613,-1,494,966,861,198,437,89,321,-1,757,-1,455,267,-1,959,-1,616,-1,-1,-1,349,156,339,-1,102,790,359,-1,439,938,809,260],[-1,607,-1,588,328,-1,449,312,-1,644,-1,-1,145,-1,-1,398,291,258,698,857,407,-1,-1,620,716,822,-1,-1,293,486,943,-1,779,-1,6,880,116,775,-1,947],[591,-1,727,680,282,290,120,452,777,863,-1,-1,409,383,848,-1,-1,251,398,260,27,867,83,523,728,-1,349,293,-1,212,684,505,341,384,9,992,507,48,-1,-1],[762,920,225,875,589,-1,797,-1,330,25,406,165,68,364,258,-1,-1,-1,222,-1,651,140,463,639,-1,-1,156,486,212,-1,-1,349,723,-1,-1,186,-1,36,240,752],[182,-1,578,-1,-1,786,358,978,936,385,989,-1,359,966,112,950,765,807,-1,991,80,403,361,936,889,-1,339,943,684,-1,-1,965,302,676,725,-1,327,134,-1,147],[56,-1,699,615,873,-1,232,900,883,-1,772,675,-1,227,-1,68,196,-1,649,182,927,962,-1,-1,349,736,-1,-1,505,349,965,-1,474,178,833,-1,-1,555,853,-1],[-1,315,-1,-1,477,554,550,-1,286,342,932,250,814,-1,900,193,504,-1,-1,351,-1,785,-1,-1,-1,576,102,779,341,723,302,474,-1,689,-1,-1,-1,451,-1,-1],[884,649,898,409,-1,817,-1,901,-1,470,7,686,218,-1,-1,-1,757,-1,-1,477,974,-1,512,490,963,-1,790,-1,384,-1,676,178,689,-1,245,596,445,-1,-1,343],[412,937,294,758,-1,33,305,-1,174,-1,-1,995,186,807,-1,697,-1,461,-1,867,977,511,931,-1,150,697,359,6,9,-1,725,833,-1,245,-1,949,-1,270,-1,112],[273,-1,-1,221,19,-1,997,-1,-1,-1,823,366,-1,993,818,-1,542,501,-1,-1,-1,-1,-1,695,447,946,-1,880,992,186,-1,-1,-1,596,949,-1,91,-1,768,273],[636,185,575,-1,450,54,662,225,-1,-1,391,191,-1,-1,639,390,-1,-1,-1,-1,-1,1,224,-1,-1,443,439,116,507,-1,327,-1,-1,445,-1,91,-1,248,-1,344],[-1,102,168,-1,-1,506,744,533,-1,730,-1,-1,929,-1,268,588,395,-1,654,889,457,-1,690,505,292,-1,938,775,48,36,134,555,451,-1,270,-1,248,-1,371,680],[-1,636,432,76,-1,386,686,770,828,582,-1,433,203,526,600,848,227,616,-1,217,117,707,369,109,586,205,809,-1,-1,240,-1,853,-1,-1,-1,768,-1,371,-1,540],[774,289,833,257,-1,381,239,722,711,468,933,-1,-1,17,-1,-1,148,-1,-1,853,-1,-1,-1,-1,264,194,260,947,-1,752,147,-1,-1,343,112,273,344,680,540,-1]
+];
+```
+
 ## --seed-contents--
 
 ```js
-function euler107() {
+function minimalNetwork(network) {
 
   return true;
 }
 
-euler107();
+const testNetwork = [
+  [-1,-1,-1,427,668,495,377,678,-1,177,-1,-1,870,-1,869,624,300,609,131,-1,251,-1,-1,-1,856,221,514,-1,591,762,182,56,-1,884,412,273,636,-1,-1,774],[-1,-1,262,-1,-1,508,472,799,-1,956,578,363,940,143,-1,162,122,910,-1,729,802,941,922,573,531,539,667,607,-1,920,-1,-1,315,649,937,-1,185,102,636,289],[-1,262,-1,-1,926,-1,958,158,647,47,621,264,81,-1,402,813,649,386,252,391,264,637,349,-1,-1,-1,108,-1,727,225,578,699,-1,898,294,-1,575,168,432,833],[427,-1,-1,-1,366,-1,-1,635,-1,32,962,468,893,854,718,427,448,916,258,-1,760,909,529,311,404,-1,-1,588,680,875,-1,615,-1,409,758,221,-1,-1,76,257],[668,-1,926,366,-1,-1,-1,250,268,-1,503,944,-1,677,-1,727,793,457,981,191,-1,-1,-1,351,969,925,987,328,282,589,-1,873,477,-1,-1,19,450,-1,-1,-1],[495,508,-1,-1,-1,-1,-1,765,711,819,305,302,926,-1,-1,582,-1,861,-1,683,293,-1,-1,66,-1,27,-1,-1,290,-1,786,-1,554,817,33,-1,54,506,386,381],[377,472,958,-1,-1,-1,-1,-1,-1,120,42,-1,134,219,457,639,538,374,-1,-1,-1,966,-1,-1,-1,-1,-1,449,120,797,358,232,550,-1,305,997,662,744,686,239],[678,799,158,635,250,765,-1,-1,-1,35,-1,106,385,652,160,-1,890,812,605,953,-1,-1,-1,79,-1,712,613,312,452,-1,978,900,-1,901,-1,-1,225,533,770,722],[-1,-1,647,-1,268,711,-1,-1,-1,283,-1,172,-1,663,236,36,403,286,986,-1,-1,810,761,574,53,793,-1,-1,777,330,936,883,286,-1,174,-1,-1,-1,828,711],[177,956,47,32,-1,819,120,35,283,-1,50,-1,565,36,767,684,344,489,565,-1,-1,103,810,463,733,665,494,644,863,25,385,-1,342,470,-1,-1,-1,730,582,468],[-1,578,621,962,503,305,42,-1,-1,50,-1,155,519,-1,-1,256,990,801,154,53,474,650,402,-1,-1,-1,966,-1,-1,406,989,772,932,7,-1,823,391,-1,-1,933],[-1,363,264,468,944,302,-1,106,172,-1,155,-1,-1,-1,380,438,-1,41,266,-1,-1,104,867,609,-1,270,861,-1,-1,165,-1,675,250,686,995,366,191,-1,433,-1],[870,940,81,893,-1,926,134,385,-1,565,519,-1,-1,313,851,-1,-1,-1,248,220,-1,826,359,829,-1,234,198,145,409,68,359,-1,814,218,186,-1,-1,929,203,-1],[-1,143,-1,854,677,-1,219,652,663,36,-1,-1,313,-1,132,-1,433,598,-1,-1,168,870,-1,-1,-1,128,437,-1,383,364,966,227,-1,-1,807,993,-1,-1,526,17],[869,-1,402,718,-1,-1,457,160,236,767,-1,380,851,132,-1,-1,596,903,613,730,-1,261,-1,142,379,885,89,-1,848,258,112,-1,900,-1,-1,818,639,268,600,-1],[624,162,813,427,727,582,639,-1,36,684,256,438,-1,-1,-1,-1,539,379,664,561,542,-1,999,585,-1,-1,321,398,-1,-1,950,68,193,-1,697,-1,390,588,848,-1],[300,122,649,448,793,-1,538,890,403,344,990,-1,-1,433,596,539,-1,-1,73,-1,318,-1,-1,500,-1,968,-1,291,-1,-1,765,196,504,757,-1,542,-1,395,227,148],[609,910,386,916,457,861,374,812,286,489,801,41,-1,598,903,379,-1,-1,-1,946,136,399,-1,941,707,156,757,258,251,-1,807,-1,-1,-1,461,501,-1,-1,616,-1],[131,-1,252,258,981,-1,-1,605,986,565,154,266,248,-1,613,664,73,-1,-1,686,-1,-1,575,627,817,282,-1,698,398,222,-1,649,-1,-1,-1,-1,-1,654,-1,-1],[-1,729,391,-1,191,683,-1,953,-1,-1,53,-1,220,-1,730,561,-1,946,686,-1,-1,389,729,553,304,703,455,857,260,-1,991,182,351,477,867,-1,-1,889,217,853],[251,802,264,760,-1,293,-1,-1,-1,-1,474,-1,-1,168,-1,542,318,136,-1,-1,-1,-1,392,-1,-1,-1,267,407,27,651,80,927,-1,974,977,-1,-1,457,117,-1],[-1,941,637,909,-1,-1,966,-1,810,103,650,104,826,870,261,-1,-1,399,-1,389,-1,-1,-1,202,-1,-1,-1,-1,867,140,403,962,785,-1,511,-1,1,-1,707,-1],[-1,922,349,529,-1,-1,-1,-1,761,810,402,867,359,-1,-1,999,-1,-1,575,729,392,-1,-1,388,939,-1,959,-1,83,463,361,-1,-1,512,931,-1,224,690,369,-1],[-1,573,-1,311,351,66,-1,79,574,463,-1,609,829,-1,142,585,500,941,627,553,-1,202,388,-1,164,829,-1,620,523,639,936,-1,-1,490,-1,695,-1,505,109,-1],[856,531,-1,404,969,-1,-1,-1,53,733,-1,-1,-1,-1,379,-1,-1,707,817,304,-1,-1,939,164,-1,-1,616,716,728,-1,889,349,-1,963,150,447,-1,292,586,264],[221,539,-1,-1,925,27,-1,712,793,665,-1,270,234,128,885,-1,968,156,282,703,-1,-1,-1,829,-1,-1,-1,822,-1,-1,-1,736,576,-1,697,946,443,-1,205,194],[514,667,108,-1,987,-1,-1,613,-1,494,966,861,198,437,89,321,-1,757,-1,455,267,-1,959,-1,616,-1,-1,-1,349,156,339,-1,102,790,359,-1,439,938,809,260],[-1,607,-1,588,328,-1,449,312,-1,644,-1,-1,145,-1,-1,398,291,258,698,857,407,-1,-1,620,716,822,-1,-1,293,486,943,-1,779,-1,6,880,116,775,-1,947],[591,-1,727,680,282,290,120,452,777,863,-1,-1,409,383,848,-1,-1,251,398,260,27,867,83,523,728,-1,349,293,-1,212,684,505,341,384,9,992,507,48,-1,-1],[762,920,225,875,589,-1,797,-1,330,25,406,165,68,364,258,-1,-1,-1,222,-1,651,140,463,639,-1,-1,156,486,212,-1,-1,349,723,-1,-1,186,-1,36,240,752],[182,-1,578,-1,-1,786,358,978,936,385,989,-1,359,966,112,950,765,807,-1,991,80,403,361,936,889,-1,339,943,684,-1,-1,965,302,676,725,-1,327,134,-1,147],[56,-1,699,615,873,-1,232,900,883,-1,772,675,-1,227,-1,68,196,-1,649,182,927,962,-1,-1,349,736,-1,-1,505,349,965,-1,474,178,833,-1,-1,555,853,-1],[-1,315,-1,-1,477,554,550,-1,286,342,932,250,814,-1,900,193,504,-1,-1,351,-1,785,-1,-1,-1,576,102,779,341,723,302,474,-1,689,-1,-1,-1,451,-1,-1],[884,649,898,409,-1,817,-1,901,-1,470,7,686,218,-1,-1,-1,757,-1,-1,477,974,-1,512,490,963,-1,790,-1,384,-1,676,178,689,-1,245,596,445,-1,-1,343],[412,937,294,758,-1,33,305,-1,174,-1,-1,995,186,807,-1,697,-1,461,-1,867,977,511,931,-1,150,697,359,6,9,-1,725,833,-1,245,-1,949,-1,270,-1,112],[273,-1,-1,221,19,-1,997,-1,-1,-1,823,366,-1,993,818,-1,542,501,-1,-1,-1,-1,-1,695,447,946,-1,880,992,186,-1,-1,-1,596,949,-1,91,-1,768,273],[636,185,575,-1,450,54,662,225,-1,-1,391,191,-1,-1,639,390,-1,-1,-1,-1,-1,1,224,-1,-1,443,439,116,507,-1,327,-1,-1,445,-1,91,-1,248,-1,344],[-1,102,168,-1,-1,506,744,533,-1,730,-1,-1,929,-1,268,588,395,-1,654,889,457,-1,690,505,292,-1,938,775,48,36,134,555,451,-1,270,-1,248,-1,371,680],[-1,636,432,76,-1,386,686,770,828,582,-1,433,203,526,600,848,227,616,-1,217,117,707,369,109,586,205,809,-1,-1,240,-1,853,-1,-1,-1,768,-1,371,-1,540],[774,289,833,257,-1,381,239,722,711,468,933,-1,-1,17,-1,-1,148,-1,-1,853,-1,-1,-1,-1,264,194,260,947,-1,752,147,-1,-1,343,112,273,344,680,540,-1]
+];
+
+minimalNetwork(testNetwork);
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
index d216cfa9fd..3b8d6f014f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
@@ -10,19 +10,17 @@ dashedName: problem-108-diophantine-reciprocals-i
 
 In the following equation x, y, and n are positive integers.
 
-1/`x` + 1/`y` = 1/`n`
+$$\frac{1}{x} + \frac{1}{y} = \frac{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
+$$\begin{align} & \frac{1}{5} + \frac{1}{20} = \frac{1}{4}\\\\ \\\\ & \frac{1}{6} + \frac{1}{12} = \frac{1}{4}\\\\ \\\\ & \frac{1}{8} + \frac{1}{8} = \frac{1}{4} \end{align}$$
 
 What is the least value of `n` for which the number of distinct solutions exceeds one-thousand?
 
 # --hints--
 
-`diophantineOne()` should return 180180.
+`diophantineOne()` should return `180180`.
 
 ```js
 assert.strictEqual(diophantineOne(), 180180);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-109-darts.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-109-darts.md
index e7a580b45b..3b16fe7ac6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-109-darts.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-109-darts.md
@@ -10,28 +10,26 @@ dashedName: problem-109-darts
 
 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:
+<img class="img-responsive center-block" alt="Darts board" src="https://cdn.freecodecamp.org/curriculum/project-euler/darts.png" style="background-color: white; padding: 10px;" />
 
-D3
+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.
 
-D1 D2
+At the center 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.
 
-S2 D2
+There are many variations of rules but in the most popular game the players will begin with a score of 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 center 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".
 
-D2 D1
+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:
 
-S4 D1
+$$\begin{array} \text{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 \end{array}$$
 
-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?
+Note that D1 D2 is considered different from 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.
+`darts()` should return `38182`.
 
 ```js
-assert.strictEqual(euler109(), 38182);
+assert.strictEqual(darts(), 38182);
 ```
 
 # --seed--
@@ -39,12 +37,12 @@ assert.strictEqual(euler109(), 38182);
 ## --seed-contents--
 
 ```js
-function euler109() {
+function darts() {
 
   return true;
 }
 
-euler109();
+darts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
index c50c81a164..79070c6654 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
@@ -10,15 +10,17 @@ dashedName: problem-110-diophantine-reciprocals-ii
 
 In the following equation x, y, and n are positive integers.
 
-1/`x` + 1/`y` = 1/`n`
+$$\frac{1}{x} + \frac{1}{y} = \frac{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?
 
+**Note:** This problem is a much more difficult version of Problem 108 and as it is well beyond the limitations of a brute force approach it requires a clever implementation.
+
 # --hints--
 
-`diophantineTwo()` should return 9350130049860600.
+`diophantineTwo()` should return `9350130049860600`.
 
 ```js
 assert.strictEqual(diophantineTwo(), 9350130049860600);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
index 920085b1f3..a6a9958de7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
@@ -10,24 +10,35 @@ dashedName: problem-111-primes-with-runs
 
 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
+$$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.
+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.
+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
+| 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).
+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.
+`primesWithRuns()` should return `612407567715`.
 
 ```js
-assert.strictEqual(euler111(), 612407567715);
+assert.strictEqual(primesWithRuns(), 612407567715);
 ```
 
 # --seed--
@@ -35,12 +46,12 @@ assert.strictEqual(euler111(), 612407567715);
 ## --seed-contents--
 
 ```js
-function euler111() {
+function primesWithRuns() {
 
   return true;
 }
 
-euler111();
+primesWithRuns();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
index cd998d5bde..d2b8f07198 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
@@ -22,10 +22,10 @@ Find the least number for which the proportion of bouncy numbers is exactly 99%.
 
 # --hints--
 
-`euler112()` should return 1587000.
+`bouncyNumbers()` should return `1587000`.
 
 ```js
-assert.strictEqual(euler112(), 1587000);
+assert.strictEqual(bouncyNumbers(), 1587000);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler112(), 1587000);
 ## --seed-contents--
 
 ```js
-function euler112() {
+function bouncyNumbers() {
 
   return true;
 }
 
-euler112();
+bouncyNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
index bc28697a24..a06f41a9a5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
@@ -14,16 +14,16 @@ Similarly if no digit is exceeded by the digit to its right it is called a decre
 
 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.
+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 ${10}^{10}$.
 
-How many numbers below a googol (10100) are not bouncy?
+How many numbers below a googol (${10}^{100}$) are not bouncy?
 
 # --hints--
 
-`euler113()` should return 51161058134250.
+`nonBouncyNumbers()` should return `51161058134250`.
 
 ```js
-assert.strictEqual(euler113(), 51161058134250);
+assert.strictEqual(nonBouncyNumbers(), 51161058134250);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler113(), 51161058134250);
 ## --seed-contents--
 
 ```js
-function euler113() {
+function nonBouncyNumbers() {
 
   return true;
 }
 
-euler113();
+nonBouncyNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
index c9ec66c9aa..c6690bddf5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
@@ -10,14 +10,18 @@ dashedName: problem-114-counting-block-combinations-i
 
 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).
+<img class="img-responsive center-block" alt="Possible ways of placing block with a minimum length of three units, on a row with length of seven units" src="https://cdn.freecodecamp.org/curriculum/project-euler/counting-block-combinations-i.png" style="background-color: white; padding: 10px;" />
+
+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.
+`countingBlockOne()` should return `16475640049`.
 
 ```js
-assert.strictEqual(euler114(), 16475640049);
+assert.strictEqual(countingBlockOne(), 16475640049);
 ```
 
 # --seed--
@@ -25,12 +29,12 @@ assert.strictEqual(euler114(), 16475640049);
 ## --seed-contents--
 
 ```js
-function euler114() {
+function countingBlockOne() {
 
   return true;
 }
 
-euler114();
+countingBlockOne();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
index 069a8a2c38..1e65da5610 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
@@ -8,26 +8,26 @@ 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.
 
-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.
 
-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.
+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.
+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.
+For m = 50, find the least value of `n` for which the fill-count function first exceeds one million.
+
+**Note:** This is a more difficult version of Problem 114.
 
 # --hints--
 
-`euler115()` should return 168.
+`countingBlockTwo()` should return `168`.
 
 ```js
-assert.strictEqual(euler115(), 168);
+assert.strictEqual(countingBlockTwo(), 168);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler115(), 168);
 ## --seed-contents--
 
 ```js
-function euler115() {
+function countingBlockTwo() {
 
   return true;
 }
 
-euler115();
+countingBlockTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
index 1f61195dea..a88bc07a34 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
@@ -12,18 +12,26 @@ A row of five black square tiles is to have a number of its tiles replaced with
 
 If red tiles are chosen there are exactly seven ways this can be done.
 
+<img class="img-responsive center-block" alt="Possible ways to placing red oblong on a row with length of five units" src="https://cdn.freecodecamp.org/curriculum/project-euler/red-green-or-blue-tiles-1.png" style="background-color: white; padding: 10px;" />
+
 If green tiles are chosen there are three ways.
 
+<img class="img-responsive center-block" alt="Possible ways of placing green oblong on a row with length of five units" src="https://cdn.freecodecamp.org/curriculum/project-euler/red-green-or-blue-tiles-2.png" style="background-color: white; padding: 10px;" />
+
 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.
+<img class="img-responsive center-block" alt="Possible ways of placing blue oblong on a row with length of five units" src="https://cdn.freecodecamp.org/curriculum/project-euler/red-green-or-blue-tiles-3.png" style="background-color: white; padding: 10px;" />
+
+Assuming that colors 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 colors cannot be mixed and at least one colored tile must be used?
+
+**Note:** This is related to Problem 117.
 
 # --hints--
 
-`euler116()` should return 20492570929.
+`redGreenBlueOne()` should return `20492570929`.
 
 ```js
-assert.strictEqual(euler116(), 20492570929);
+assert.strictEqual(redGreenBlueOne(), 20492570929);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler116(), 20492570929);
 ## --seed-contents--
 
 ```js
-function euler116() {
+function redGreenBlueOne() {
 
   return true;
 }
 
-euler116();
+redGreenBlueOne();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
index 80f46d1201..ed6d035559 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
@@ -10,14 +10,18 @@ dashedName: problem-117-red-green-and-blue-tiles
 
 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.
+<img class="img-responsive center-block" alt="Possible ways of placing red, green and blue oblongs on a row with length of five units" src="https://cdn.freecodecamp.org/curriculum/project-euler/red-green-and-blue-tiles.png" style="background-color: white; padding: 10px;" />
+
+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.
+`redGreenBlueTilesTwo()` should return `100808458960497`.
 
 ```js
-assert.strictEqual(euler117(), 100808458960497);
+assert.strictEqual(redGreenBlueTilesTwo(), 100808458960497);
 ```
 
 # --seed--
@@ -25,12 +29,12 @@ assert.strictEqual(euler117(), 100808458960497);
 ## --seed-contents--
 
 ```js
-function euler117() {
+function redGreenBlueTilesTwo() {
 
   return true;
 }
 
-euler117();
+redGreenBlueTilesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
index 8bcd4b5dcd..00a0605319 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
@@ -8,16 +8,16 @@ 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.
+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.
+`pandigitalPrimeSets()` should return `44680`.
 
 ```js
-assert.strictEqual(euler118(), 44680);
+assert.strictEqual(pandigitalPrimeSets(), 44680);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler118(), 44680);
 ## --seed-contents--
 
 ```js
-function euler118() {
+function pandigitalPrimeSets() {
 
   return true;
 }
 
-euler118();
+pandigitalPrimeSets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
index 40853a1314..72ed8397d7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
@@ -8,20 +8,20 @@ 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.
+The number 512 is interesting because it is equal to the sum of its digits raised to some power: $5 + 1 + 2 = 8$, and $8^3 = 512$. Another example of a number with this property is $614656 = 28^4$.
 
-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.
+We shall define an to be the $n-th$ 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.
+You are given that $a_2 = 512$ and $a_{10} = 614656$.
 
-Find a30.
+Find $a_{30}$.
 
 # --hints--
 
-`euler119()` should return 248155780267521.
+`digitPowerSum()` should return `248155780267521`.
 
 ```js
-assert.strictEqual(euler119(), 248155780267521);
+assert.strictEqual(digitPowerSum(), 248155780267521);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler119(), 248155780267521);
 ## --seed-contents--
 
 ```js
-function euler119() {
+function digitPowerSum() {
 
   return true;
 }
 
-euler119();
+digitPowerSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-120-square-remainders.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
index 6bcf398e78..828f12b906 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
@@ -8,18 +8,18 @@ dashedName: problem-120-square-remainders
 
 # --description--
 
-Let r be the remainder when (a−1)n + (a+1)n is divided by a2.
+Let `r` be the remainder when ${(a − 1)}^n + {(a + 1)}^n$ is divided by $a^2$.
 
-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 example, if $a = 7$ and $n = 3$, then $r = 42: 6^3 + 8^3 = 728 ≡ 42 \\ \text{mod}\\ 49$. And as `n` varies, so too will `r`, but for $a = 7$ it turns out that $r_{max} = 42$.
 
-For 3 ≤ a ≤ 1000, find ∑ rmax.
+For $3 ≤ a ≤ 1000$, find $\sum{r}_{max}$.
 
 # --hints--
 
-`euler120()` should return 333082500.
+`squareRemainders()` should return `333082500`.
 
 ```js
-assert.strictEqual(euler120(), 333082500);
+assert.strictEqual(squareRemainders(), 333082500);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler120(), 333082500);
 ## --seed-contents--
 
 ```js
-function euler120() {
+function squareRemainders() {
 
   return true;
 }
 
-euler120();
+squareRemainders();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
index df95c1f9f0..c739b6384a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
@@ -10,16 +10,48 @@ dashedName: problem-182-rsa-encryption
 
 The RSA encryption is based on the following procedure:
 
-Generate two distinct primes p and q.Compute n=pq and φ=(p-1)(q-1).
+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`
 
-Find an integer e, 1&lt;e&lt;φ, such='' that='' gcd(e,φ)='1.' a='' message='' in='' this='' system='' is='' number='' the='' interval='' \[0,n-1].='' text='' to='' be='' encrypted='' then='' somehow='' converted='' messages='' (numbers='' \[0,n-1]).='' encrypt='' text,='' for='' each='' message,='' m,='' c='me' mod='' n='' calculated.='' decrypt='' following='' procedure='' needed:='' calculate='' d='' ed='1' φ,='' c,='' m='cd' n.='' there='' exist='' values='' of='' e='' and='' me='' call='' which='' unconcealed='' messages.='' an='' issue='' when='' choosing='' should='' not='' too='' many='' instance,='' let='' p='19' q='37.' φ='18\*36=648.' if='' we='' choose='' then,='' although='' gcd(181,648)='1' it='' turns='' out='' all='' possible='' messagesm='' (0≤m≤n-1)='' are='' calculating='' any='' valid='' choice='' some='' it's='' important='' at='' minimum.='' find='' sum='' e,='' 1&lt;e&lt;φ(1009,3643)='' so='' value='' &lt;='' section=''>&lt;/e&lt;φ,>
+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--
 
-`euler182()` should return 399788195976.
+`RSAEncryption` should be a function.
 
 ```js
-assert.strictEqual(euler182(), 399788195976);
+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--
@@ -27,16 +59,44 @@ assert.strictEqual(euler182(), 399788195976);
 ## --seed-contents--
 
 ```js
-function euler182() {
+function RSAEncryption(p, q) {
 
   return true;
 }
 
-euler182();
+RSAEncryption(19, 37);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
index 2559b17664..fe1724d44f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
@@ -12,22 +12,46 @@ We shall say that an `n`-digit number is pandigital if it makes use of all the d
 
 The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.
 
-Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.
+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()` should return a number.
+`pandigitalProducts(4)` should return a number.
 
 ```js
-assert(typeof pandigitalProducts() === 'number');
+assert(typeof pandigitalProducts(4) === 'number');
 ```
 
-`pandigitalProducts()` should return 45228.
+`pandigitalProducts(4)` should return `12`.
 
 ```js
-assert.strictEqual(pandigitalProducts(), 45228);
+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--
@@ -35,22 +59,21 @@ assert.strictEqual(pandigitalProducts(), 45228);
 ## --seed-contents--
 
 ```js
-function pandigitalProducts() {
+function pandigitalProducts(n) {
 
   return true;
 }
 
-pandigitalProducts();
+pandigitalProducts(4);
 ```
 
 # --solutions--
 
 ```js
-function pandigitalProducts() {
-  function is1to9Pandigital(...numbers) {
-    const digitStr = concatenateNums(...numbers);
-    // check if length is 9
-    if (digitStr.length !== 9) {
+function pandigitalProducts(n) {
+  function is1toNPandigital(n, digitStr) {
+    // check if length is n
+    if (digitStr.length !== n) {
       return false;
     }
     // check if pandigital
@@ -70,15 +93,24 @@ function pandigitalProducts() {
   }
 
   const pandigitalNums = [];
+  const limit = 10 ** Math.floor(n / 2) - 1;
   let sum = 0;
-  for (let mult1 = 2; mult1 < 9876; mult1++) {
-    let mult2 = 123;
-    while (concatenateNums(mult1, mult2, mult1 * mult2).length < 10) {
-      if (is1to9Pandigital(mult1, mult2, mult1 * mult2) && !pandigitalNums.includes(mult1 * mult2)) {
-        pandigitalNums.push(mult1 * mult2);
-        sum += mult1 * mult2;
+  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;
       }
-      mult2++;
     }
   }
   return sum;
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
index e73c284fff..239ba5a6a1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
@@ -16,7 +16,7 @@ The ant is always oriented in one of the cardinal directions (left, right, up or
 
 \- 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?
+Starting with a grid that is entirely white, how many squares are black after 10<sup>18</sup> moves of the ant?
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
index e0ccd868bb..1c3f0c56c6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
@@ -10,30 +10,32 @@ dashedName: problem-38-pandigital-multiples
 
 Take the number 192 and multiply it by each of 1, 2, and 3:
 
-<div style='margin-left: 4em;'>
-  192 × 1 = 192<br>
-  192 × 2 = 384<br>
-  192 × 3 = 576<br>
-</div>
+$$\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 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1, 2, ... , `n`) where `n` > 1?
+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()` should return a number.
+`pandigitalMultiples(8)` should return a number.
 
 ```js
-assert(typeof pandigitalMultiples() === 'number');
+assert(typeof pandigitalMultiples(8) === 'number');
 ```
 
-`pandigitalMultiples()` should return 932718654.
+`pandigitalMultiples(8)` should return `78156234`.
 
 ```js
-assert.strictEqual(pandigitalMultiples(), 932718654);
+assert.strictEqual(pandigitalMultiples(8), 78156234);
+```
+
+`pandigitalMultiples(9)` should return `932718654`.
+
+```js
+assert.strictEqual(pandigitalMultiples(9), 932718654);
 ```
 
 # --seed--
@@ -41,38 +43,37 @@ assert.strictEqual(pandigitalMultiples(), 932718654);
 ## --seed-contents--
 
 ```js
-function pandigitalMultiples() {
+function pandigitalMultiples(k) {
 
   return true;
 }
 
-pandigitalMultiples();
+pandigitalMultiples(8);
 ```
 
 # --solutions--
 
 ```js
-function pandigitalMultiples() {
-
-  function get9DigitConcatenatedProduct(num) {
-    // returns false if concatenated product is not 9 digits
+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 < 9; i++) {
+    for (let i = 2; concatenatedProduct.length < k; i++) {
       concatenatedProduct += num * i;
     }
-    return concatenatedProduct.length === 9 ? concatenatedProduct : false;
+    return concatenatedProduct.length === k ? concatenatedProduct : false;
   }
 
-  function is1to9Pandigital(num) {
+  function is1toKPandigital(num, k) {
     const numStr = num.toString();
 
-    // check if length is not 9
-    if (numStr.length !== 9) {
+    // check if length is not k
+    if (numStr.length !== k) {
       return false;
     }
 
     // check if pandigital
-    for (let i = 9; i > 0; i--) {
+    for (let i = k; i > 0; i--) {
       if (numStr.indexOf(i.toString()) === -1) {
         return false;
       }
@@ -81,11 +82,13 @@ function pandigitalMultiples() {
   }
 
   let largestNum = 0;
-  for (let i = 9999; i >= 9000; i--) {
-    const concatenatedProduct =  get9DigitConcatenatedProduct(i);
-    if (is1to9Pandigital(concatenatedProduct) && concatenatedProduct > largestNum) {
-      largestNum = parseInt(concatenatedProduct);
-      break;
+  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/chinese-traditional/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
index df442b6fc4..7c3a5a8342 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
@@ -10,49 +10,50 @@ dashedName: problem-43-sub-string-divisibility
 
 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<sub>1</sub> be the 1<sup>st</sup> digit, d<sub>2</sub> be the 2<sup>nd</sup> digit, and so on. In this way, we note the following:
+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:
 
-<ul>
-  <li>d<sub>2</sub>d<sub>3</sub>d<sub>4</sub> = 406 is divisible by 2</li>
-  <li>d<sub>3</sub>d<sub>4</sub>d<sub>5</sub> = 063 is divisible by 3</li>
-  <li>d<sub>4</sub>d<sub>5</sub>d<sub>6</sub> = 635 is divisible by 5</li>
-  <li>d<sub>5</sub>d<sub>6</sub>d<sub>7</sub> = 357 is divisible by 7</li>
-  <li>d<sub>6</sub>d<sub>7</sub>d<sub>8</sub> = 572 is divisible by 11</li>
-  <li>d<sub>7</sub>d<sub>8</sub>d<sub>9</sub> = 728 is divisible by 13</li>
-  <li>d<sub>8</sub>d<sub>9</sub>d<sub>10</sub> = 289 is divisible by 17</li>
-</ul>
+- ${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 numbers of all 0 to 9 pandigital numbers with this property.
+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()` should return an array.
+`substringDivisibility(5)` should return a number.
 
 ```js
-assert(Array.isArray(substringDivisibility()));
+assert(typeof substringDivisibility(5) === 'number');
 ```
 
-`substringDivisibility()` should return [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ].
+`substringDivisibility(5)` should return `12444480`.
 
 ```js
-assert.sameMembers(substringDivisibility(), [
-  1430952867,
-  1460357289,
-  1406357289,
-  4130952867,
-  4160357289,
-  4106357289
-]);
+assert.strictEqual(substringDivisibility(5), 12444480)
 ```
 
-You should not copy and return the array.
+`substringDivisibility(7)` should return `1099210170`.
 
 ```js
-assert(
-  !code.match(
-      /(1430952867)|(1460357289)|(1406357289)|(4130952867)|(4160357289)|(4106357289)/
-    )
-);
+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--
@@ -60,16 +61,66 @@ assert(
 ## --seed-contents--
 
 ```js
-function substringDivisibility() {
+function substringDivisibility(n) {
 
-  return [];
+  return true;
 }
 
-substringDivisibility();
+substringDivisibility(5);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-461-almost-pi.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
index 50a12c051c..9903fbe010 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
@@ -8,26 +8,46 @@ dashedName: problem-461-almost-pi
 
 # --description--
 
-Let fn(k) = ek/n - 1, for all non-negative integers k.
+Let `f(k, n)` = $e^\frac{k}{n} - 1$, for all non-negative integers `k`.
 
-Remarkably, f200(6) + f200(75) + f200(89) + f200(226) = 3.141592644529… ≈ π.
+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 fn(a) + fn(b) + fn(c) + fn(d) for n = 200.
+In fact, it is the best approximation of π of the form `f(a, 200) + f(b, 200) + f(c, 200) + f(d, 200)`.
 
-Let g(n) = a2 + b2 + c2 + d 2 for a, b, c, d that minimize the error: | fn(a) + fn(b) + fn(c) + fn(d) - π|
+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$
 
-(where |x| denotes the absolute value of x).
-
-You are given g(200) = 62 + 752 + 892 + 2262 = 64658.
-
-Find g(10000).
+You are given `almostPi(200)` = 6<sup>2</sup> + 75<sup>2</sup> + 89<sup>2</sup> + 226<sup>2</sup> = 64658.
 
 # --hints--
 
-`euler461()` should return 159820276.
+`almostPi` should be a function.
 
 ```js
-assert.strictEqual(euler461(), 159820276);
+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--
@@ -35,16 +55,99 @@ assert.strictEqual(euler461(), 159820276);
 ## --seed-contents--
 
 ```js
-function euler461() {
+function almostPi(n) {
 
   return true;
 }
-
-euler461();
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
index 7190e580ae..d890d42133 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
@@ -12,20 +12,32 @@ By replacing the 1st digit of the 2-digit number \*3, it turns out that six of t
 
 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.
+Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an `n` prime value family.
 
 # --hints--
 
-`primeDigitReplacements()` should return a number.
+`primeDigitReplacements(6)` should return a number.
 
 ```js
-assert(typeof primeDigitReplacements() === 'number');
+assert(typeof primeDigitReplacements(6) === 'number');
 ```
 
-`primeDigitReplacements()` should return 121313.
+`primeDigitReplacements(6)` should return `13`.
 
 ```js
-assert.strictEqual(primeDigitReplacements(), 121313);
+assert.strictEqual(primeDigitReplacements(6), 13);
+```
+
+`primeDigitReplacements(7)` should return `56003`.
+
+```js
+assert.strictEqual(primeDigitReplacements(7), 56003);
+```
+
+`primeDigitReplacements(8)` should return `121313`.
+
+```js
+assert.strictEqual(primeDigitReplacements(8), 121313);
 ```
 
 # --seed--
@@ -33,16 +45,81 @@ assert.strictEqual(primeDigitReplacements(), 121313);
 ## --seed-contents--
 
 ```js
-function primeDigitReplacements() {
+function primeDigitReplacements(n) {
 
   return true;
 }
 
-primeDigitReplacements();
+primeDigitReplacements(6);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+function primeDigitReplacements(n) {
+  function isNFamily(number, primesMap, n) {
+    const prime = number.toString();
+    const lastDigit = prime[prime.length - 1];
+    return (
+      doesReplacingMakeFamily(prime, '0', primesMap, n) ||
+      (lastDigit !== '1' &&
+        doesReplacingMakeFamily(prime, '1', primesMap, n)) ||
+      doesReplacingMakeFamily(prime, '2', primesMap, n)
+    );
+  }
+
+  function doesReplacingMakeFamily(prime, digitToReplace, primesMap, family) {
+    let count = 0;
+    const replaceWith = '0123456789';
+
+    for (let i = 0; i < replaceWith.length; i++) {
+      const nextNumber = parseInt(
+        prime.replace(new RegExp(digitToReplace, 'g'), replaceWith[i]),
+        10
+      );
+
+      if (isPartOfFamily(nextNumber, prime, primesMap)) {
+        count++;
+      }
+    }
+    return count === family;
+  }
+
+  function isPartOfFamily(number, prime, primesMap) {
+    return (
+      isPrime(number, primesMap) && number.toString().length === prime.length
+    );
+  }
+
+  function getSievePrimes(max) {
+    const primesMap = new Array(max).fill(true);
+    primesMap[0] = false;
+    primesMap[1] = false;
+
+    for (let i = 2; i < max; i++) {
+      if (primesMap[i]) {
+        let j = i * i;
+        for (j; j < max; j += i) {
+          primesMap[j] = false;
+        }
+      }
+    }
+    return primesMap;
+  }
+
+  function isPrime(num, primesMap) {
+    return primesMap[num];
+  }
+
+  const primesMap = getSievePrimes(1000000);
+
+  for (let number = 1; number < 300000; number++) {
+    if (primesMap[number]) {
+      if (isNFamily(number, primesMap, n)) {
+        return number;
+      }
+    }
+  }
+  return -1;
+}
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
index 080123c5aa..d5431d8135 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
@@ -10,20 +10,26 @@ dashedName: problem-52-permuted-multiples
 
 It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.
 
-Find the smallest positive integer, `x`, such that `2x`, `3x`, `4x`, `5x`, and `6x`, contain the same digits.
+Find the smallest positive integer, such that multiplied by integers $\\{2, 3, \ldots, n\\}$, contain the same digits.
 
 # --hints--
 
-`permutedMultiples()` should return a number.
+`permutedMultiples(2)` should return a number.
 
 ```js
-assert(typeof permutedMultiples() === 'number');
+assert(typeof permutedMultiples(2) === 'number');
 ```
 
-`permutedMultiples()` should return 142857.
+`permutedMultiples(2)` should return `125874`.
 
 ```js
-assert.strictEqual(permutedMultiples(), 142857);
+assert.strictEqual(permutedMultiples(2), 125874);
+```
+
+`permutedMultiples(6)` should return `142857`.
+
+```js
+assert.strictEqual(permutedMultiples(6), 142857);
 ```
 
 # --seed--
@@ -31,18 +37,18 @@ assert.strictEqual(permutedMultiples(), 142857);
 ## --seed-contents--
 
 ```js
-function permutedMultiples() {
+function permutedMultiples(n) {
 
   return true;
 }
 
-permutedMultiples();
+permutedMultiples(2);
 ```
 
 # --solutions--
 
 ```js
-function permutedMultiples() {
+function permutedMultiples(n) {
     const isPermutation = (a, b) =>
         a.length !== b.length
             ? false
@@ -55,9 +61,9 @@ function permutedMultiples() {
 
     while (!found) {
         start *= 10;
-        for (let i = start; i < start * 10 / 6; i++) {
+        for (let i = start; i < start * 10 / n; i++) {
             found = true;
-            for (let j = 2; j <= 6; j++) {
+            for (let j = 2; j <= n; j++) {
                 if (!isPermutation(i + '', j * i + '')) {
                     found = false;
                     break;
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
index fbe0693bb2..407314741a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
@@ -8,22 +8,46 @@ dashedName: problem-56-powerful-digit-sum
 
 # --description--
 
-A googol (10<sup>100</sup>) is a massive number: one followed by one-hundred zeros; 100<sup>100</sup> is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.
+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, `ab`, where `a`, `b` &lt; 100, what is the maximum digital sum?
+Considering natural numbers of the form, $a^b$, where `a`, `b` &lt; `n`, what is the maximum digital sum?
 
 # --hints--
 
-`powerfulDigitSum()` should return a number.
+`powerfulDigitSum(3)` should return a number.
 
 ```js
-assert(typeof powerfulDigitSum() === 'number');
+assert(typeof powerfulDigitSum(3) === 'number');
 ```
 
-`powerfulDigitSum()` should return 972.
+`powerfulDigitSum(3)` should return `4`.
 
 ```js
-assert.strictEqual(powerfulDigitSum(), 972);
+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--
@@ -31,16 +55,47 @@ assert.strictEqual(powerfulDigitSum(), 972);
 ## --seed-contents--
 
 ```js
-function powerfulDigitSum() {
+function powerfulDigitSum(n) {
 
   return true;
 }
 
-powerfulDigitSum();
+powerfulDigitSum(3);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
index e57107565f..17103bc6fe 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
@@ -24,20 +24,32 @@ $1 + \\frac 1 {2 + \\frac 1 {2+\\frac 1 {2+\\frac 1 2}}} = \\frac {41}{29} = 1.4
 
 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 one-thousand expansions, how many fractions contain a numerator with more digits than denominator?
+In the first `n` expansions, how many fractions contain a numerator with more digits than denominator?
 
 # --hints--
 
-`squareRootConvergents()` should return a number.
+`squareRootConvergents(10)` should return a number.
 
 ```js
-assert(typeof squareRootConvergents() === 'number');
+assert(typeof squareRootConvergents(10) === 'number');
 ```
 
-`squareRootConvergents()` should return 153.
+`squareRootConvergents(10)` should return 1.
 
 ```js
-assert.strictEqual(squareRootConvergents(), 153);
+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--
@@ -45,16 +57,42 @@ assert.strictEqual(squareRootConvergents(), 153);
 ## --seed-contents--
 
 ```js
-function squareRootConvergents() {
+function squareRootConvergents(n) {
 
   return true;
 }
 
-squareRootConvergents();
+squareRootConvergents(1000);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
index d9fb67db87..29a3012e44 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
@@ -22,20 +22,32 @@ Starting with 1 and spiralling anticlockwise in the following way, a square spir
 
 It is interesting to note that the odd squares lie along the bottom right diagonal, but what is more interesting is that 8 out of the 13 numbers lying along both diagonals are prime; that is, a ratio of 8/13 ≈ 62%.
 
-If one complete new layer is wrapped around the spiral above, a square spiral with side length 9 will be formed. If this process is continued, what is the side length of the square spiral for which the ratio of primes along both diagonals first falls below 10%?
+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()` should return a number.
+`spiralPrimes(50)` should return a number.
 
 ```js
-assert(typeof spiralPrimes() === 'number');
+assert(typeof spiralPrimes(50) === 'number');
 ```
 
-`spiralPrimes()` should return 26241.
+`spiralPrimes(50)` should return `11`.
 
 ```js
-assert.strictEqual(spiralPrimes(), 26241);
+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--
@@ -43,16 +55,51 @@ assert.strictEqual(spiralPrimes(), 26241);
 ## --seed-contents--
 
 ```js
-function spiralPrimes() {
+function spiralPrimes(percent) {
 
   return true;
 }
 
-spiralPrimes();
+spiralPrimes(50);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
index 04ace60de8..8989f4171c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
@@ -10,37 +10,53 @@ dashedName: problem-61-cyclical-figurate-numbers
 
 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<sub>3</sub>,<var><sub>n</sub></var>=<var>n</var>(<var>n</var>+1)/2  | 1, 3, 6, 10, 15, ...  |
-| Square         | P<sub>4</sub>,<var><sub>n</sub></var>=<var>n</var><sup>2</sup>        | 1, 4, 9, 16, 25, ...  |
-| Pentagonal     | P<sub>5</sub>,<var><sub>n</sub></var>=<var>n</var>(3<var>n</var>−1)/2 | 1, 5, 12, 22, 35, ... |
-| Hexagonal      | P<sub>6</sub>,<var><sub>n</sub></var>=<var>n</var>(2<var>n</var>−1)   | 1, 6, 15, 28, 45, ... |
-| Heptagonal     | P<sub>7</sub>,<var><sub>n</sub></var>=<var>n</var>(5<var>n</var>−3)/2 | 1, 7, 18, 34, 55, ... |
-| Octagonal      | P<sub>8</sub>,<var><sub>n</sub></var>=<var>n</var>(3<var>n</var>−2)   | 1, 8, 21, 40, 65, ... |
+| 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.
 
-<ol>
-  <li>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).</li>
-  <li>Each polygonal type: triangle (P<sub>3,127</sub> = 8128), square (P<sub>4,91</sub> = 8281), and pentagonal (P<sub>5,44</sub> = 2882), is represented by a different number in the set.</li>
-  <li>This is the only set of 4-digit numbers with this property.</li>
-</ol>
+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 the only ordered set of six cyclic 4-digit numbers for which each polygonal type: triangle, square, pentagonal, hexagonal, heptagonal, and octagonal, is represented by a different number in the set.
+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()` should return a number.
+`cyclicalFigurateNums(3)` should return a number.
 
 ```js
-assert(typeof cyclicalFigurateNums() === 'number');
+assert(typeof cyclicalFigurateNums(3) === 'number');
 ```
 
-`cyclicalFigurateNums()` should return 28684.
+`cyclicalFigurateNums(3)` should return `19291`.
 
 ```js
-assert.strictEqual(cyclicalFigurateNums(), 28684);
+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--
@@ -48,16 +64,189 @@ assert.strictEqual(cyclicalFigurateNums(), 28684);
 ## --seed-contents--
 
 ```js
-function cyclicalFigurateNums() {
+function cyclicalFigurateNums(n) {
 
   return true;
 }
 
-cyclicalFigurateNums();
+cyclicalFigurateNums(3);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
index fb98324efe..82294e0708 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
@@ -8,22 +8,40 @@ dashedName: problem-62-cubic-permutations
 
 # --description--
 
-The cube, 41063625 (345<sup>3</sup>), can be permuted to produce two other cubes: 56623104 (384<sup>3</sup>) and 66430125 (405<sup>3</sup>). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube.
+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 five permutations of its digits are cube.
+Find the smallest cube for which exactly `n` permutations of its digits are cube.
 
 # --hints--
 
-`cubicPermutations()` should return a number.
+`cubicPermutations(2)` should return a number.
 
 ```js
-assert(typeof cubicPermutations() === 'number');
+assert(typeof cubicPermutations(2) === 'number');
 ```
 
-`cubicPermutations()` should return 127035954683.
+`cubicPermutations(2)` should return `125`.
 
 ```js
-assert.strictEqual(cubicPermutations(), 127035954683);
+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--
@@ -31,16 +49,49 @@ assert.strictEqual(cubicPermutations(), 127035954683);
 ## --seed-contents--
 
 ```js
-function cubicPermutations() {
+function cubicPermutations(n) {
 
   return true;
 }
 
-cubicPermutations();
+cubicPermutations(2);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
index 661240b19c..02c9603685 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
@@ -10,20 +10,74 @@ dashedName: problem-63-powerful-digit-counts
 
 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.
 
-How many `n`-digit positive integers exist which are also an `n`th power?
+Complete the function so that it returns how many positive integers are of length `n` and an `n`th power.
 
 # --hints--
 
-`powerfulDigitCounts()` should return a number.
+`powerfulDigitCounts(1)` should return a number.
 
 ```js
-assert(typeof powerfulDigitCounts() === 'number');
+assert(typeof powerfulDigitCounts(1) === 'number');
 ```
 
-`powerfulDigitCounts()` should return 49.
+`powerfulDigitCounts(1)` should return `9`.
 
 ```js
-assert.strictEqual(powerfulDigitCounts(), 49);
+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--
@@ -31,16 +85,38 @@ assert.strictEqual(powerfulDigitCounts(), 49);
 ## --seed-contents--
 
 ```js
-function powerfulDigitCounts() {
+function powerfulDigitCounts(n) {
 
   return true;
 }
 
-powerfulDigitCounts();
+powerfulDigitCounts(1);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
index dedc83de20..6cc017e1fb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
@@ -64,20 +64,38 @@ $\\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 10\\,000$ have an odd period?
+How many continued fractions for $N \\le n$ have an odd period?
 
 # --hints--
 
-`oddPeriodSqrts()` should return a number.
+`oddPeriodSqrts(13)` should return a number.
 
 ```js
-assert(typeof oddPeriodSqrts() === 'number');
+assert(typeof oddPeriodSqrts(13) === 'number');
 ```
 
-`oddPeriodSqrts()` should return 1322.
+`oddPeriodSqrts(500)` should return `83`.
 
 ```js
-assert.strictEqual(oddPeriodSqrts(), 1322);
+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--
@@ -85,16 +103,46 @@ assert.strictEqual(oddPeriodSqrts(), 1322);
 ## --seed-contents--
 
 ```js
-function oddPeriodSqrts() {
+function oddPeriodSqrts(n) {
 
   return true;
 }
 
-oddPeriodSqrts();
+oddPeriodSqrts(13);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
index ca61b8fa36..7a1383a7f0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
@@ -26,20 +26,44 @@ $2, 3, \\dfrac{8}{3}, \\dfrac{11}{4}, \\dfrac{19}{7}, \\dfrac{87}{32}, \\dfrac{1
 
 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 100<sup>th</sup> convergent of the continued fraction for `e`.
+Find the sum of digits in the numerator of the `n`<sup>th</sup> convergent of the continued fraction for `e`.
 
 # --hints--
 
-`convergentsOfE()` should return a number.
+`convergentsOfE(10)` should return a number.
 
 ```js
-assert(typeof convergentsOfE() === 'number');
+assert(typeof convergentsOfE(10) === 'number');
 ```
 
-`convergentsOfE()` should return 272.
+`convergentsOfE(10)` should return `17`.
 
 ```js
-assert.strictEqual(convergentsOfE(), 272);
+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--
@@ -47,16 +71,47 @@ assert.strictEqual(convergentsOfE(), 272);
 ## --seed-contents--
 
 ```js
-function convergentsOfE() {
+function convergentsOfE(n) {
 
   return true;
 }
 
-convergentsOfE();
+convergentsOfE(10);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
index 956b98cbef..0eab98070b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
@@ -28,20 +28,44 @@ By finding minimal solutions in x for D = {2, 3, 5, 6, 7}, we obtain the followi
 
 Hence, by considering minimal solutions in `x` for D ≤ 7, the largest `x` is obtained when D=5.
 
-Find the value of D ≤ 1000 in minimal solutions of `x` for which the largest value of `x` is obtained.
+Find the value of D ≤ `n` in minimal solutions of `x` for which the largest value of `x` is obtained.
 
 # --hints--
 
-`diophantineEquation()` should return a number.
+`diophantineEquation(7)` should return a number.
 
 ```js
-assert(typeof diophantineEquation() === 'number');
+assert(typeof diophantineEquation(7) === 'number');
 ```
 
-`diophantineEquation()` should return 661.
+`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(), 661);
+assert.strictEqual(diophantineEquation(1000), 661);
 ```
 
 # --seed--
@@ -49,16 +73,57 @@ assert.strictEqual(diophantineEquation(), 661);
 ## --seed-contents--
 
 ```js
-function diophantineEquation() {
+function diophantineEquation(n) {
 
   return true;
 }
 
-diophantineEquation();
+diophantineEquation(7);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
index da2c7676e0..9e1e818c9c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
@@ -28,19 +28,19 @@ Find the maximum total from top to bottom in `numTriangle`, a 2D array defined i
 `maximumPathSumII(testTriangle)` should return a number.
 
 ```js
-assert(typeof maximumPathSumII(testTriangle) === 'number');
+assert(typeof maximumPathSumII(_testTriangle) === 'number');
 ```
 
 `maximumPathSumII(testTriangle)` should return 23.
 
 ```js
-assert.strictEqual(maximumPathSumII(testTriangle), 23);
+assert.strictEqual(maximumPathSumII(_testTriangle), 23);
 ```
 
 `maximumPathSumII(numTriangle)` should return 7273.
 
 ```js
-assert.strictEqual(maximumPathSumII(numTriangle), 7273);
+assert.strictEqual(maximumPathSumII(_numTriangle), 7273);
 ```
 
 # --seed--
@@ -48,7 +48,11 @@ assert.strictEqual(maximumPathSumII(numTriangle), 7273);
 ## --before-user-code--
 
 ```js
-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]];
+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--
@@ -70,5 +74,23 @@ maximumPathSumII(testTriangle);
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
index 06e4e360f9..2e538e324d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
@@ -8,40 +8,58 @@ dashedName: problem-69-totient-maximum
 
 # --description--
 
-Euler's Totient function, φ(`n`) \[sometimes called the phi function], is used to determine the number of numbers less than `n` which are relatively prime to `n`. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
+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;'>
 
-| !!crwdBlockTags_15_sgaTkcolBdwrc!! | Relatively Prime | φ(!!crwdBlockTags_16_sgaTkcolBdwrc!!) |!!crwdBlockTags_17_sgaTkcolBdwrc!!/φ(!!crwdBlockTags_18_sgaTkcolBdwrc!!) |
-| ------------ | ---------------- | --------------- | ---------------------------- |
-| 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                          |
+| $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 `n`/φ(`n`) for `n` ≤ 10.
+It can be seen that `n` = 6 produces a maximum $\displaystyle\frac{n}{{\phi}(n)}$ for `n` ≤ 10.
 
-Find the value of `n` ≤ 1,000,000 for which n/φ(`n`) is a maximum.
+Find the value of `n` ≤ `limit` for which $\displaystyle\frac{n}{{\phi(n)}}$ is a maximum.
 
 # --hints--
 
-`totientMaximum()` should return a number.
+`totientMaximum(10)` should return a number.
 
 ```js
-assert(typeof totientMaximum() === 'number');
+assert(typeof totientMaximum(10) === 'number');
 ```
 
-`totientMaximum()` should return 510510.
+`totientMaximum(10)` should return `6`.
 
 ```js
-assert.strictEqual(totientMaximum(), 510510);
+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--
@@ -49,16 +67,44 @@ assert.strictEqual(totientMaximum(), 510510);
 ## --seed-contents--
 
 ```js
-function totientMaximum() {
+function totientMaximum(limit) {
 
   return true;
 }
 
-totientMaximum();
+totientMaximum(10);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
index 5f3d2bb361..09c3e10628 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
@@ -8,24 +8,42 @@ dashedName: problem-70-totient-permutation
 
 # --description--
 
-Euler's Totient function, φ(`n`) \[sometimes called the phi function], is used to determine the number of positive numbers less than or equal to `n` which are relatively prime to `n`. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6. The number 1 is considered to be relatively prime to every positive number, so φ(1)=1.
+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, φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.
+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; 10<sup>7</sup>, for which φ(`n`) is a permutation of `n` and the ratio `n`/φ(`n`) produces a minimum.
+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()` should return a number.
+`totientPermutation(10000)` should return a number.
 
 ```js
-assert(typeof totientPermutation() === 'number');
+assert(typeof totientPermutation(10000) === 'number');
 ```
 
-`totientPermutation()` should return 8319823.
+`totientPermutation(10000)` should return `4435`.
 
 ```js
-assert.strictEqual(totientPermutation(), 8319823);
+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--
@@ -33,16 +51,68 @@ assert.strictEqual(totientPermutation(), 8319823);
 ## --seed-contents--
 
 ```js
-function totientPermutation() {
+function totientPermutation(limit) {
 
   return true;
 }
 
-totientPermutation();
+totientPermutation(10000);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
index 3e0d91f5cf..55a2e9b72f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
@@ -8,28 +8,52 @@ dashedName: problem-71-ordered-fractions
 
 # --description--
 
-Consider the fraction, `n`/`d`, where `n` and `d` are positive integers. If `n`&lt;`d` and HCF(`n`,`d`)=1, it is called a reduced proper fraction.
+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:
 
-<div style='text-align: center;'>1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, <strong>2/5</strong>, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8</div>
+$$\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 2/5 is the fraction immediately to the left of 3/7.
+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` ≤ 1,000,000 in ascending order of size, find the numerator of the fraction immediately to the left of 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()` should return a number.
+`orderedFractions(8)` should return a number.
 
 ```js
-assert(typeof orderedFractions() === 'number');
+assert(typeof orderedFractions(8) === 'number');
 ```
 
-`orderedFractions()` should return 428570.
+`orderedFractions(8)` should return `2`.
 
 ```js
-assert.strictEqual(orderedFractions(), 428570);
+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--
@@ -37,16 +61,35 @@ assert.strictEqual(orderedFractions(), 428570);
 ## --seed-contents--
 
 ```js
-function orderedFractions() {
+function orderedFractions(limit) {
 
   return true;
 }
 
-orderedFractions();
+orderedFractions(8);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
index ac66afa5a4..3929bde7af 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
@@ -8,28 +8,46 @@ dashedName: problem-72-counting-fractions
 
 # --description--
 
-Consider the fraction, `n`/`d`, where n and d are positive integers. If `n`&lt;`d` and HCF(`n`,`d`)=1, it is called a reduced proper fraction.
+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:
 
-<div style='text-align: center;'>1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8</div>
+$$\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.
+It can be seen that there are `21` elements in this set.
 
-How many elements would be contained in the set of reduced proper fractions for `d` ≤ 1,000,000?
+How many elements would be contained in the set of reduced proper fractions for `d` ≤ `limit`?
 
 # --hints--
 
-`countingFractions()` should return a number.
+`countingFractions(8)` should return a number.
 
 ```js
-assert(typeof countingFractions() === 'number');
+assert(typeof countingFractions(8) === 'number');
 ```
 
-`countingFractions()` should return 303963552391.
+`countingFractions(8)` should return `21`.
 
 ```js
-assert.strictEqual(countingFractions(), 303963552391);
+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--
@@ -37,16 +55,36 @@ assert.strictEqual(countingFractions(), 303963552391);
 ## --seed-contents--
 
 ```js
-function countingFractions() {
+function countingFractions(limit) {
 
   return true;
 }
 
-countingFractions();
+countingFractions(8);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
index 68b3e0d702..10c1ae6ea8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
@@ -8,28 +8,46 @@ dashedName: problem-73-counting-fractions-in-a-range
 
 # --description--
 
-Consider the fraction, `n`/`d`, where n and d are positive integers. If `n`&lt;`d` and HCF(`n`,`d`)=1, it is called a reduced proper fraction.
+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:
 
-<div style='text-align: center;'>1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, <strong>3/8</strong>, <strong>2/5</strong>, <strong>3/7</strong>, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8</div>
+$$\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 1/3 and 1/2.
+It can be seen that there are `3` fractions between $\frac{1}{3}$ and $\frac{1}{2}$.
 
-How many fractions lie between 1/3 and 1/2 in the sorted set of reduced proper fractions for `d` ≤ 12,000?
+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()` should return a number.
+`countingFractionsInARange(8)` should return a number.
 
 ```js
-assert(typeof countingFractionsInARange() === 'number');
+assert(typeof countingFractionsInARange(8) === 'number');
 ```
 
-`countingFractionsInARange()` should return 7295372.
+`countingFractionsInARange(8)` should return `3`.
 
 ```js
-assert.strictEqual(countingFractionsInARange(), 7295372);
+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--
@@ -37,16 +55,29 @@ assert.strictEqual(countingFractionsInARange(), 7295372);
 ## --seed-contents--
 
 ```js
-function countingFractionsInARange() {
+function countingFractionsInARange(limit) {
 
   return true;
 }
 
-countingFractionsInARange();
+countingFractionsInARange(8);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
index c1eeeda4d7..eb9a6e9d13 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
@@ -10,39 +10,50 @@ dashedName: problem-74-digit-factorial-chains
 
 The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145:
 
-<div style='margin-left: 4em;'>1! + 4! + 5! = 1 + 24 + 120 = 145</div>
+$$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:
 
-<div style='margin-left: 4em;'>
-  169 → 363601 → 1454 → 169<br>
-  871 → 45361 → 871<br>
-  872 → 45362 → 872<br>
-</div>
+$$\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,
 
-<div style='margin-left: 4em;'>
-  69 → 363600 → 1454 → 169 → 363601 (→ 1454)<br>
-  78 → 45360 → 871 → 45361 (→ 871)<br>
-  540 → 145 (→ 145)<br>
-</div>
+$$\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 one million, contain exactly sixty non-repeating terms?
+How many chains, with a starting number below `n`, contain exactly sixty non-repeating terms?
 
 # --hints--
 
-`digitFactorialChains()` should return a number.
+`digitFactorialChains(2000)` should return a number.
 
 ```js
-assert(typeof digitFactorialChains() === 'number');
+assert(typeof digitFactorialChains(2000) === 'number');
 ```
 
-`digitFactorialChains()` should return 402.
+`digitFactorialChains(2000)` should return `6`.
 
 ```js
-assert.strictEqual(digitFactorialChains(), 402);
+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--
@@ -50,16 +61,63 @@ assert.strictEqual(digitFactorialChains(), 402);
 ## --seed-contents--
 
 ```js
-function digitFactorialChains() {
+function digitFactorialChains(n) {
 
   return true;
 }
 
-digitFactorialChains();
+digitFactorialChains(2000);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
index 4a71f87c72..a20c0a95ea 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
@@ -16,29 +16,47 @@ It turns out that 12 cm is the smallest length of wire that can be bent to form
   <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>
+  <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)
+  <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 ≤ 1,500,000 can exactly one integer sided right angle triangle be formed?
+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()` should return a number.
+`singularIntRightTriangles(48)` should return a number.
 
 ```js
-assert(typeof singularIntRightTriangles() === 'number');
+assert(typeof singularIntRightTriangles(48) === 'number');
 ```
 
-`singularIntRightTriangles()` should return 161667.
+`singularIntRightTriangles(48)` should return `6`.
 
 ```js
-assert.strictEqual(singularIntRightTriangles(), 161667);
+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--
@@ -46,16 +64,54 @@ assert.strictEqual(singularIntRightTriangles(), 161667);
 ## --seed-contents--
 
 ```js
-function singularIntRightTriangles() {
+function singularIntRightTriangles(n) {
 
   return true;
 }
 
-singularIntRightTriangles();
+singularIntRightTriangles(48);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-76-counting-summations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
index dded902e52..bbc9618245 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
@@ -16,23 +16,41 @@ It is possible to write five as a sum in exactly six different ways:
   3 + 1 + 1<br>
   2 + 2 + 1<br>
   2 + 1 + 1 + 1<br>
-  1 + 1 + 1 + 1 + 1<br>
+  1 + 1 + 1 + 1 + 1<br><br>
 </div>
 
-How many different ways can one hundred be written as a sum of at least two positive integers?
+How many different ways can `n` be written as a sum of at least two positive integers?
 
 # --hints--
 
-`countingSummations()` should return a number.
+`countingSummations(5)` should return a number.
 
 ```js
-assert(typeof countingSummations() === 'number');
+assert(typeof countingSummations(5) === 'number');
 ```
 
-`countingSummations()` should return 190569291.
+`countingSummations(5)` should return `6`.
 
 ```js
-assert.strictEqual(countingSummations(), 190569291);
+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--
@@ -40,16 +58,26 @@ assert.strictEqual(countingSummations(), 190569291);
 ## --seed-contents--
 
 ```js
-function countingSummations() {
+function countingSummations(n) {
 
   return true;
 }
 
-countingSummations();
+countingSummations(5);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-77-prime-summations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
index fade056d03..bd26cc3c69 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
@@ -15,23 +15,41 @@ It is possible to write ten as the sum of primes in exactly five different ways:
   5 + 5<br>
   5 + 3 + 2<br>
   3 + 3 + 2 + 2<br>
-  2 + 2 + 2 + 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 five thousand different ways?
+What is the first value which can be written as the sum of primes in over `n` ways?
 
 # --hints--
 
-`primeSummations()` should return a number.
+`primeSummations(5)` should return a number.
 
 ```js
-assert(typeof primeSummations() === 'number');
+assert(typeof primeSummations(5) === 'number');
 ```
 
-`primeSummations()` should return 71.
+`primeSummations(5)` should return `11`.
 
 ```js
-assert.strictEqual(primeSummations(), 71);
+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--
@@ -39,16 +57,54 @@ assert.strictEqual(primeSummations(), 71);
 ## --seed-contents--
 
 ```js
-function primeSummations() {
+function primeSummations(n) {
 
   return true;
 }
 
-primeSummations();
+primeSummations(5);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
index c5d96870e5..61f145116f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
@@ -8,7 +8,7 @@ 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.
+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;'>
 
@@ -22,22 +22,40 @@ Let p(n) represent the number of different ways in which n coins can be separate
 | OO   O   O   O    |
 | O   O   O   O   O |
 
-</div>
+</div><br>
 
-Find the least value of `n` for which p(`n`) is divisible by one million.
+Find the least value of `n` for which ${p}(n)$ is divisible by `divisor`.
 
 # --hints--
 
-`coinPartitions()` should return a number.
+`coinPartitions(7)` should return a number.
 
 ```js
-assert(typeof coinPartitions() === 'number');
+assert(typeof coinPartitions(7) === 'number');
 ```
 
-`coinPartitions()` should return 55374.
+`coinPartitions(7)` should return `5`.
 
 ```js
-assert.strictEqual(coinPartitions(), 55374);
+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--
@@ -45,16 +63,41 @@ assert.strictEqual(coinPartitions(), 55374);
 ## --seed-contents--
 
 ```js
-function coinPartitions() {
+function coinPartitions(divisor) {
 
   return true;
 }
 
-coinPartitions();
+coinPartitions(7);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
index a88a40e6ae..e9858fa539 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
@@ -8,28 +8,54 @@ 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.
+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 array, `keylog`, contains fifty successful login attempts.
+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(keylog)` should return a number.
+`passcodeDerivation(keylog1)` should return a number.
 
 ```js
-assert(typeof passcodeDerivation(keylog) === 'number');
+assert(typeof passcodeDerivation(_keylog1) === 'number');
 ```
 
-`passcodeDerivation(keylog)` should return 73162890.
+`passcodeDerivation(keylog1)` should return `531278`.
 
 ```js
-assert.strictEqual(passcodeDerivation(keylog), 73162890);
+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
@@ -40,15 +66,50 @@ function passcodeDerivation(arr) {
 
 // Only change code above this line
 
-const keylog = [
+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(keylog);
+passcodeDerivation(keylog1);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
index 2f8be71b43..a552334705 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
@@ -10,22 +10,34 @@ dashedName: problem-80-square-root-digital-expansion
 
 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.
+The square root of two is `1.41421356237309504880...`, and the digital sum of the first one hundred decimal digits is `475`.
 
-For the first one hundred natural numbers, find the total of the digital sums of the first one hundred decimal digits for all the irrational square roots.
+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()` should return a number.
+`sqrtDigitalExpansion(2)` should return a number.
 
 ```js
-assert(typeof sqrtDigitalExpansion() === 'number');
+assert(typeof sqrtDigitalExpansion(2) === 'number');
 ```
 
-`sqrtDigitalExpansion()` should return 40886.
+`sqrtDigitalExpansion(2)` should return `475`.
 
 ```js
-assert.strictEqual(sqrtDigitalExpansion(), 40886);
+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--
@@ -33,16 +45,65 @@ assert.strictEqual(sqrtDigitalExpansion(), 40886);
 ## --seed-contents--
 
 ```js
-function sqrtDigitalExpansion() {
+function sqrtDigitalExpansion(n) {
 
   return true;
 }
 
-sqrtDigitalExpansion();
+sqrtDigitalExpansion(2);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
index 630903b7cc..542d6ce39a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
@@ -8,46 +8,45 @@ 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.
+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`.
 
-<div style='text-align: center;'>
-  $\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}$
-</div>
+  $$\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 containing an 80 by 80 matrix.
+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(testMatrix)` should return a number.
+`pathSumTwoWays(testMatrix1)` should return a number.
 
 ```js
-assert(typeof pathSumTwoWays(testMatrix) === 'number');
+assert(typeof pathSumTwoWays(_testMatrix1) === 'number');
 ```
 
-`pathSumTwoWays(testMatrix)` should return 2427.
+`pathSumTwoWays(testMatrix1)` should return `2427`.
 
 ```js
-assert.strictEqual(pathSumTwoWays(testMatrix), 2427);
+assert.strictEqual(pathSumTwoWays(_testMatrix1), 2427);
 ```
 
-`pathSumTwoWays(matrix)` should return 427337.
+`pathSumTwoWays(testMatrix2)` should return `427337`.
 
 ```js
-assert.strictEqual(pathSumTwoWays(matrix), 427337);
+assert.strictEqual(pathSumTwoWays(_testMatrix2), 427337);
 ```
 
 # --seed--
 
-## --before-user-code--
+## --after-user-code--
 
 ```js
-const matrix = [
+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],
@@ -134,14 +133,14 @@ const matrix = [
 ## --seed-contents--
 
 ```js
-function pathSumTwoWays(arr) {
+function pathSumTwoWays(matrix) {
 
   return true;
 }
 
 // Only change code above this line
 
-const testMatrix = [
+const testMatrix1 = [
   [131, 673, 234, 103, 18],
   [201, 96, 342, 965, 150],
   [630, 803, 746, 422, 111],
@@ -149,11 +148,36 @@ const testMatrix = [
   [805, 732, 524, 37, 331]
 ];
 
-pathSumTwoWays(testMatrix);
+pathSumTwoWays(testMatrix1);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
index f2947d34a6..ec68b544e2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
@@ -10,46 +10,45 @@ dashedName: problem-82-path-sum-three-ways
 
 **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.
+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`.
 
-<div style='text-align: center;'>
-  $\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}$
-</div>
+  $$\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 containing an 80 by 80 matrix.
+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(testMatrix)` should return a number.
+`pathSumThreeWays(testMatrix1)` should return a number.
 
 ```js
-assert(typeof pathSumThreeWays(testMatrix) === 'number');
+assert(typeof pathSumThreeWays(_testMatrix1) === 'number');
 ```
 
-`pathSumThreeWays(testMatrix)` should return 994.
+`pathSumThreeWays(testMatrix1)` should return `994`.
 
 ```js
-assert.strictEqual(pathSumThreeWays(testMatrix), 994);
+assert.strictEqual(pathSumThreeWays(_testMatrix1), 994);
 ```
 
-`pathSumThreeWays(matrix)` should return 260324.
+`pathSumThreeWays(testMatrix2)` should return `260324`.
 
 ```js
-assert.strictEqual(pathSumThreeWays(matrix), 260324);
+assert.strictEqual(pathSumThreeWays(_testMatrix2), 260324);
 ```
 
 # --seed--
 
-## --before-user-code--
+## --after-user-code--
 
 ```js
-const matrix = [
+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],
@@ -136,14 +135,14 @@ const matrix = [
 ## --seed-contents--
 
 ```js
-function pathSumThreeWays(arr) {
+function pathSumThreeWays(matrix) {
 
   return true;
 }
 
 // Only change code above this line
 
-const testMatrix = [
+const testMatrix1 = [
   [131, 673, 234, 103, 18],
   [201, 96, 342, 965, 150],
   [630, 803, 746, 422, 111],
@@ -151,11 +150,44 @@ const testMatrix = [
   [805, 732, 524, 37, 331]
 ];
 
-pathSumThreeWays(testMatrix);
+pathSumThreeWays(testMatrix1);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
index 40a008132a..ce957c019f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
@@ -10,46 +10,45 @@ dashedName: problem-83-path-sum-four-ways
 
 **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.
+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`.
 
-<div style='text-align: center;'>
-  $\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}$
-</div>
+  $$\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 defined in the background, containing an 80 by 80 matrix.
+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(testMatrix)` should return a number.
+`pathSumFourWays(testMatrix1)` should return a number.
 
 ```js
-assert(typeof pathSumFourWays(testMatrix) === 'number');
+assert(typeof pathSumFourWays(_testMatrix1) === 'number');
 ```
 
-`pathSumFourWays(testMatrix)` should return 2297.
+`pathSumFourWays(testMatrix1)` should return `2297`.
 
 ```js
-assert.strictEqual(pathSumFourWays(testMatrix), 2297);
+assert.strictEqual(pathSumFourWays(_testMatrix1), 2297);
 ```
 
-`pathSumFourWays(matrix)` should return 425185.
+`pathSumFourWays(testMatrix2)` should return `425185`.
 
 ```js
-assert.strictEqual(pathSumFourWays(matrix), 425185);
+assert.strictEqual(pathSumFourWays(_testMatrix2), 425185);
 ```
 
 # --seed--
 
-## --before-user-code--
+## --after-user-code--
 
 ```js
-const matrix = [
+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],
@@ -136,14 +135,14 @@ const matrix = [
 ## --seed-contents--
 
 ```js
-function pathSumFourWays(arr) {
+function pathSumFourWays(matrix) {
 
   return true;
 }
 
 // Only change code above this line
 
-const testMatrix = [
+const testMatrix1 = [
   [131, 673, 234, 103, 18],
   [201, 96, 342, 965, 150],
   [630, 803, 746, 422, 111],
@@ -151,11 +150,64 @@ const testMatrix = [
   [805, 732, 524, 37, 331]
 ];
 
-pathSumFourWays(testMatrix);
+pathSumFourWays(testMatrix1);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
index f9429edeaf..6870d2e420 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
@@ -86,7 +86,7 @@ In the game, *Monopoly*, the standard board is set up in the following way:
       </tr>
     </tbody>
   </table>
-</div>
+</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.
 
@@ -120,22 +120,40 @@ The heart of this problem concerns the likelihood of visiting a particular squar
 
 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.
+Statistically it can be shown that the three most popular squares, in order, are JAIL (6.24%) = Square 10, E3 (3.18%) = Square 24, and GO (3.09%) = Square 00. So these three most popular squares can be listed with the six-digit modal string `102400`.
 
-If, instead of using two 6-sided dice, two 4-sided dice are used, find the six-digit modal string.
+If, instead of using two 6-sided dice, two `n`-sided dice are used, find the six-digit modal string.
 
 # --hints--
 
-`monopolyOdds()` should return a number.
+`monopolyOdds(8)` should return a string.
 
 ```js
-assert(typeof monopolyOdds() === 'number');
+assert(typeof monopolyOdds(8) === 'string');
 ```
 
-`monopolyOdds()` should return 101524.
+`monopolyOdds(8)` should return string `102400`.
 
 ```js
-assert.strictEqual(monopolyOdds(), 101524);
+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--
@@ -143,16 +161,108 @@ assert.strictEqual(monopolyOdds(), 101524);
 ## --seed-contents--
 
 ```js
-function monopolyOdds() {
+function monopolyOdds(n) {
 
   return true;
 }
 
-monopolyOdds();
+monopolyOdds(8);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
index 50935108e6..c6d4c9c2c6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
@@ -12,20 +12,44 @@ By counting carefully it can be seen that a rectangular grid measuring 3 by 2 co
 
 <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 exists no rectangular grid that contains exactly two million rectangles, find the area of the grid with the nearest solution.
+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()` should return a number.
+`countingRectangles(18)` should return a number.
 
 ```js
-assert(typeof countingRectangles() === 'number');
+assert(typeof countingRectangles(18) === 'number');
 ```
 
-`countingRectangles()` should return 2772.
+`countingRectangles(18)` should return `6`.
 
 ```js
-assert.strictEqual(countingRectangles(), 2772);
+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--
@@ -33,16 +57,53 @@ assert.strictEqual(countingRectangles(), 2772);
 ## --seed-contents--
 
 ```js
-function countingRectangles() {
+function countingRectangles(n) {
 
   return true;
 }
 
-countingRectangles();
+countingRectangles(18);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
index 7019da3ff2..bcd935b24d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
@@ -14,22 +14,40 @@ A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a f
 
 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.
+It can be shown that there are exactly `2060` distinct cuboids, ignoring rotations, with integer dimensions, up to a maximum size of M by M by M, for which the shortest route has integer length when M = 100. This is the least value of M for which the number of solutions first exceeds two thousand; the number of solutions when M = 99 is `1975`.
 
-Find the least value of M such that the number of solutions first exceeds one million.
+Find the least value of M such that the number of solutions first exceeds `n`.
 
 # --hints--
 
-`cuboidRoute()` should return a number.
+`cuboidRoute(2000)` should return a number.
 
 ```js
-assert(typeof cuboidRoute() === 'number');
+assert(typeof cuboidRoute(2000) === 'number');
 ```
 
-`cuboidRoute()` should return 1818.
+`cuboidRoute(2000)` should return `100`.
 
 ```js
-assert.strictEqual(cuboidRoute(), 1818);
+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--
@@ -37,16 +55,40 @@ assert.strictEqual(cuboidRoute(), 1818);
 ## --seed-contents--
 
 ```js
-function cuboidRoute() {
+function cuboidRoute(n) {
 
   return true;
 }
 
-cuboidRoute();
+cuboidRoute(2000);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
index fcf84bac7b..57da5afe79 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
@@ -8,29 +8,53 @@ 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:
+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>
+</div><br>
 
-How many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power?
+How many numbers below `n` can be expressed as the sum of a prime square, prime cube, and prime fourth power?
 
 # --hints--
 
-`primePowerTriples()` should return a number.
+`primePowerTriples(50)` should return a number.
 
 ```js
-assert(typeof primePowerTriples() === 'number');
+assert(typeof primePowerTriples(50) === 'number');
 ```
 
-`primePowerTriples()` should return 1097343.
+`primePowerTriples(50)` should return `4`.
 
 ```js
-assert.strictEqual(primePowerTriples(), 1097343);
+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--
@@ -38,16 +62,70 @@ assert.strictEqual(primePowerTriples(), 1097343);
 ## --seed-contents--
 
 ```js
-function primePowerTriples() {
+function primePowerTriples(n) {
 
   return true;
 }
 
-primePowerTriples();
+primePowerTriples(50);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
index 96efafdf5d..3134d9cacf 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
@@ -8,7 +8,7 @@ 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`<sub>1</sub>, `a`<sub>2</sub>, ... , `a`<sub>k</sub>} is called a product-sum number: N = `a`<sub>1</sub> + `a`<sub>2</sub> + ... + `a`<sub>k</sub> = `a`<sub>1</sub> × `a`<sub>2</sub> × ... × `a`<sub>k</sub>.
+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.
 
@@ -20,26 +20,50 @@ For a given set of size, `k`, we shall call the smallest N with this property a
   <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>
+</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.
+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.
+In fact, as the complete set of minimal product-sum numbers for 2 ≤ `k` ≤ 12 is $\\{4, 6, 8, 12, 15, 16\\}$, the sum is `61`.
 
-What is the sum of all the minimal product-sum numbers for 2≤`k`≤12000?
+What is the sum of all the minimal product-sum numbers for 2 ≤ `k` ≤ `limit`?
 
 # --hints--
 
-`productSumNumbers()` should return a number.
+`productSumNumbers(6)` should return a number.
 
 ```js
-assert(typeof productSumNumbers() === 'number');
+assert(typeof productSumNumbers(6) === 'number');
 ```
 
-`productSumNumbers()` should return 7587457.
+`productSumNumbers(6)` should return `30`.
 
 ```js
-assert.strictEqual(productSumNumbers(), 7587457);
+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--
@@ -47,16 +71,40 @@ assert.strictEqual(productSumNumbers(), 7587457);
 ## --seed-contents--
 
 ```js
-function productSumNumbers() {
+function productSumNumbers(limit) {
 
   return true;
 }
 
-productSumNumbers();
+productSumNumbers(6);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
index 259dea83cd..3c0e7ac2aa 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
@@ -8,7 +8,18 @@ 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.
+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:
 
@@ -18,12 +29,12 @@ For example, it would appear that there are at least six ways of writing the num
   VVIIIIII<br>
   XIIIIII<br>
   VVVI<br>
-  XVI<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`, contains one thousand numbers written in valid, but not necessarily minimal, Roman numerals; see [About... Roman Numerals](https://projecteuler.net/about=roman_numerals) for the definitive rules for this problem.
+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.
 
@@ -31,39 +42,76 @@ Find the number of characters saved by writing each of these in their minimal fo
 
 # --hints--
 
-`romanNumerals(roman)` should return a number.
+`romanNumerals(testNumerals1)` should return a number.
 
 ```js
-assert(typeof romanNumerals(roman) === 'number');
+assert(typeof romanNumerals(_testNumerals1) === 'number');
 ```
 
-`romanNumerals(roman)` should return 743.
+`romanNumerals(testNumerals1)` should return `19`.
 
 ```js
-assert.strictEqual(romanNumerals(roman), 743);
+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(arr) {
+function romanNumerals(roman) {
 
   return true;
 }
 
 // Only change code above this line
 
-const roman = [
-  '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'
+const testNumerals1 = [
+  'XIIIIII', 'XVI', 'MMMCCLXVIIII', 'XXXXVI', 'MMMMXX', 'CCLI', 'CCCCXX', 'MMMMDCXXXXI', 'DCCCCIIII', 'MXVIIII'
 ];
 
-romanNumerals(roman);
+romanNumerals(testNumerals1);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
index b309ce36f9..b920e69678 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
@@ -8,28 +8,46 @@ dashedName: problem-91-right-triangles-with-integer-coordinates
 
 # --description--
 
-The points P (`x`<sub>1</sub>, `y`<sub>1</sub>) and Q (`x`<sub>2</sub>, `y`<sub>2</sub>) are plotted at integer co-ordinates and are joined to the origin, O(0,0), to form ΔOPQ.
+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`<sub>1</sub>, `y`<sub>1</sub>, `x`<sub>2</sub>, `y`<sub>2</sub> ≤ 2.
+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`<sub>1</sub>, `y`<sub>1</sub>, `x`<sub>2</sub>, `y`<sub>2</sub> ≤ 50, how many right triangles can be formed?
+Given that $0 ≤ x_1, y_1, x_2, y_2 ≤ limit$, how many right triangles can be formed?
 
 # --hints--
 
-`rightTrianglesIntCoords()` should return a number.
+`rightTrianglesIntCoords(2)` should return a number.
 
 ```js
-assert(typeof rightTrianglesIntCoords() === 'number');
+assert(typeof rightTrianglesIntCoords(2) === 'number');
 ```
 
-`rightTrianglesIntCoords()` should return 14234.
+`rightTrianglesIntCoords(2)` should return `14`.
 
 ```js
-assert.strictEqual(rightTrianglesIntCoords(), 14234);
+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--
@@ -37,16 +55,65 @@ assert.strictEqual(rightTrianglesIntCoords(), 14234);
 ## --seed-contents--
 
 ```js
-function rightTrianglesIntCoords() {
+function rightTrianglesIntCoords(limit) {
 
   return true;
 }
 
-rightTrianglesIntCoords();
+rightTrianglesIntCoords(2);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
index 7c0ecc19d0..5f62bd9da7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
@@ -12,27 +12,42 @@ A number chain is created by continuously adding the square of the digits in a n
 
 For example,
 
-<div style='margin-left: 4em;'>
-  44 → 32 → 13 → 10 → <strong>1</strong> → <strong>1</strong><br>
-  85 → <strong>89</strong> → 145 → 42 → 20 → 4 → 16 → 37 → 58 → <strong>89</strong>
-</div>
+$$\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 ten million will arrive at 89?
+How many starting numbers below `limit` will arrive at 89?
 
 # --hints--
 
-`squareDigitChains()` should return a number.
+`squareDigitChains(100)` should return a number.
 
 ```js
-assert(typeof squareDigitChains() === 'number');
+assert(typeof squareDigitChains(100) === 'number');
 ```
 
-`squareDigitChains()` should return 8581146.
+`squareDigitChains(100)` should return `80`.
 
 ```js
-assert.strictEqual(squareDigitChains(), 8581146);
+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--
@@ -40,16 +55,98 @@ assert.strictEqual(squareDigitChains(), 8581146);
 ## --seed-contents--
 
 ```js
-function squareDigitChains() {
+function squareDigitChains(limit) {
 
   return true;
 }
 
-squareDigitChains();
+squareDigitChains(100);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
index fbd3f04a8b..ef0c095e03 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
@@ -8,24 +8,42 @@ 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 <dfn>almost equilateral triangle</dfn> 5-5-6 has an area of 12 square units.
+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 <dfn>almost equilateral triangle</dfn> with integral side lengths and area and whose perimeters do not exceed one billion (1,000,000,000).
+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()` should return a number.
+`almostEquilateralTriangles(50)` should return a number.
 
 ```js
-assert(typeof almostEquilateralTriangles() === 'number');
+assert(typeof almostEquilateralTriangles(50) === 'number');
 ```
 
-`almostEquilateralTriangles()` should return 518408346.
+`almostEquilateralTriangles(50)` should return `66`.
 
 ```js
-assert.strictEqual(almostEquilateralTriangles(), 518408346);
+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--
@@ -33,16 +51,34 @@ assert.strictEqual(almostEquilateralTriangles(), 518408346);
 ## --seed-contents--
 
 ```js
-function almostEquilateralTriangles() {
+function almostEquilateralTriangles(limit) {
 
   return true;
 }
 
-almostEquilateralTriangles();
+almostEquilateralTriangles(50);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
index 037330b660..19d2301062 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
@@ -14,26 +14,42 @@ Interestingly the sum of the proper divisors of 220 is 284 and the sum of the pr
 
 Perhaps less well known are longer chains. For example, starting with 12496, we form a chain of five numbers:
 
-<div style="text-align: center;">
-  12496 → 14288 → 15472 → 14536 → 14264 (→ 12496 → ...)
-</div>
+$$ 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 one million.
+Find the smallest member of the longest amicable chain with no element exceeding `limit`.
 
 # --hints--
 
-`amicableChains()` should return a number.
+`amicableChains(300)` should return a number.
 
 ```js
-assert(typeof amicableChains() === 'number');
+assert(typeof amicableChains(300) === 'number');
 ```
 
-`amicableChains()` should return 14316.
+`amicableChains(300)` should return `220`.
 
 ```js
-assert.strictEqual(amicableChains(), 14316);
+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--
@@ -41,16 +57,68 @@ assert.strictEqual(amicableChains(), 14316);
 ## --seed-contents--
 
 ```js
-function amicableChains() {
+function amicableChains(limit) {
 
   return true;
 }
 
-amicableChains();
+amicableChains(300);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-96-su-doku.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-96-su-doku.md
index 22442b67c2..10509108d2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-96-su-doku.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-96-su-doku.md
@@ -102,49 +102,42 @@ Su Doku (Japanese meaning *number place*) is the name given to a popular puzzle
 
 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 fifty different Su Doku puzzle strings ranging in difficulty, but all with unique solutions (the first puzzle in the array is the example in the challenge description).
+The `puzzlesArr` array contains different Su Doku puzzle strings ranging in difficulty, but all with unique solutions.
 
-By solving all fifty puzzles find the sum of the 3-digit numbers found in the top left corner of each solution grid; for example, 483 is the 3-digit number found in the top left corner of the solution grid above.
+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(testPuzzles)` should return a number.
+`suDoku(testPuzzles1)` should return a number.
 
 ```js
-assert(typeof suDoku(testPuzzles) === 'number');
+assert(typeof suDoku(_testPuzzles1) === 'number');
 ```
 
-`suDoku(testPuzzles)` should return 1190.
+`suDoku(testPuzzles1)` should return `1190`.
 
 ```js
-assert.strictEqual(suDoku(testPuzzles), 1190);
+assert.strictEqual(suDoku(_testPuzzles1), 1190);
 ```
 
-`suDoku(puzzlesArr)` should return 24702.
+`suDoku(testPuzzles2)` should return `24702`.
 
 ```js
-assert.strictEqual(suDoku(puzzlesArr), 24702);
+assert.strictEqual(suDoku(_testPuzzles2), 24702);
 ```
 
 # --seed--
 
-## --seed-contents--
+## --after-user-code--
 
 ```js
-function suDoku(arr) {
-
-  return true;
-}
-
-// Only change code above this line
-
-const testPuzzles = [
+const _testPuzzles1 = [
   '003020600900305001001806400008102900700000008006708200002609500800203009005010300',
   '200080300060070084030500209000105408000000000402706000301007040720040060004010003',
   '000000907000420180000705026100904000050000040000507009920108000034059000507000000'
 ];
 
-const puzzlesArr = [
+const _testPuzzles2 = [
   '003020600900305001001806400008102900700000008006708200002609500800203009005010300',
   '200080300060070084030500209000105408000000000402706000301007040720040060004010003',
   '000000907000420180000705026100904000050000040000507009920108000034059000507000000',
@@ -196,12 +189,108 @@ const puzzlesArr = [
   '000003017015009008060000000100007000009000200000500004000000020500600340340200000',
   '300200000000107000706030500070009080900020004010800050009040301000702000000008006'
 ];
+```
 
-suDoku(testPuzzles);
+## --seed-contents--
+
+```js
+function suDoku(puzzlesArr) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testPuzzles1 = [
+  '003020600900305001001806400008102900700000008006708200002609500800203009005010300',
+  '200080300060070084030500209000105408000000000402706000301007040720040060004010003',
+  '000000907000420180000705026100904000050000040000507009920108000034059000507000000'
+];
+
+suDoku(testPuzzles1);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
index b2b651f267..15dafc79a9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
@@ -8,24 +8,42 @@ 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<sup>6972593</sup>−1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2<sup><var>p</var></sup>−1, have been found which contain more digits.
+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<sup>7830457</sup>+1.
+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 this prime number.
+Find the last ten digits of that non-Mersenne prime in the form $multiplier × 2^{power} + 1$.
 
 # --hints--
 
-`lrgNonMersennePrime()` should return a number.
+`largeNonMersennePrime(19, 6833086)` should return a string.
 
 ```js
-assert(typeof lrgNonMersennePrime() === 'number');
+assert(typeof largeNonMersennePrime(19, 6833086) === 'string');
 ```
 
-`lrgNonMersennePrime()` should return 8739992577.
+`largeNonMersennePrime(19, 6833086)` should return the string `3637590017`.
 
 ```js
-assert.strictEqual(lrgNonMersennePrime(), 8739992577);
+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--
@@ -33,16 +51,38 @@ assert.strictEqual(lrgNonMersennePrime(), 8739992577);
 ## --seed-contents--
 
 ```js
-function lrgNonMersennePrime() {
+function largeNonMersennePrime(multiplier, power) {
 
   return true;
 }
 
-lrgNonMersennePrime();
+largeNonMersennePrime(19, 6833086);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
index 7397b3f7b5..e63309053f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
@@ -8,9 +8,9 @@ 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<sup>2</sup>. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: 9216 = 96<sup>2</sup>. 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.
+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 included array, find all the square anagram word pairs (a palindromic word is NOT considered to be an anagram of itself).
+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?
 
@@ -18,39 +18,188 @@ What is the largest square number formed by any member of such a pair?
 
 # --hints--
 
-`anagramicSquares()` should return a number.
+`anagramicSquares(['CARE', 'RACE'])` should return a number.
 
 ```js
-assert(typeof anagramicSquares() === 'number');
+assert(typeof anagramicSquares(['CARE', 'RACE']) === 'number');
 ```
 
-`anagramicSquares()` should return 18769.
+`anagramicSquares(['CARE', 'RACE'])` should return `9216`.
 
 ```js
-assert.strictEqual(anagramicSquares(), 18769);
+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() {
+function anagramicSquares(words) {
 
   return true;
 }
 
 // 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"
+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();
+anagramicSquares(testWords1);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
index 959ce07657..07d9a48f01 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
@@ -8,49 +8,76 @@ dashedName: problem-99-largest-exponential
 
 # --description--
 
-Comparing two numbers written in index form like 2<sup>11</sup> and 3<sup>7</sup> is not difficult, as any calculator would confirm that 2<sup>11</sup> = 2048 &lt; 3<sup>7</sup> = 2187.
+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<sup>518061</sup> > 519432<sup>525806</sup> would be much more difficult, as both numbers contain over three million digits.
+However, confirming that $632382^{518061} &lt; 519432^{525806}$ would be much more difficult, as both numbers contain over three million digits.
 
-Using the included 2D array of base/exponent pairs, determine which pair has the greatest numerical value.
-
-**Note:** The first array in `baseExp` represent the numbers in the example given above.
+Using the 2D `baseExp` array of base/exponent pairs, determine pair with the greatest numerical value and return it.
 
 # --hints--
 
-`largestExponential()` should return a number.
+`largestExponential(testArray1)` should return an array.
 
 ```js
-assert(typeof largestExponential() === 'number');
+assert(Array.isArray(largestExponential(_testArray1)));
 ```
 
-`largestExponential()` should return 709.
+`largestExponential(testArray1)` should return `[840237, 507276]`.
 
 ```js
-assert.strictEqual(largestExponential(), 709);
+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() {
+function largestExponential(baseExp) {
 
   return true;
 }
 
 // Only change code above this line
 
-const baseExp = [
-  [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]
+const testArray1 = [
+  [492798,527927],[30125,670983],[895603,504906],[450785,531539],[840237,507276],[380711,538522],[63577,625673],[76801,615157],[502694,527123]
 ];
 
-largestExponential();
+largestExponential(testArray1);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+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/chinese-traditional/10-coding-interview-prep/rosetta-code/100-doors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/100-doors.md
index e791c06558..16fda3fa65 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/100-doors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/100-doors.md
@@ -1,6 +1,6 @@
 ---
 id: 594810f028c0303b75339acb
-title: 100 doors
+title: 100 門
 challengeType: 5
 forumTopicId: 302217
 dashedName: 100-doors
@@ -8,7 +8,7 @@ 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.
+連續 100 個門都是最初關閉的。 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--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
index ca8465f0ba..33cbddb68a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
@@ -8,7 +8,7 @@ dashedName: abundant-deficient-and-perfect-number-classifications
 
 # --description--
 
-These define three classifications of positive integers based on their [proper divisors](https://rosettacode.org/wiki/Proper divisors "Proper divisors").
+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.
 
@@ -22,7 +22,7 @@ If `P(n) > n` then `n` is classed as `abundant`
 
 # --instructions--
 
-Implement a function that calculates how many of the integers from `1` to `20,000` (inclusive) are in each of the three classes. Output the result as an array in the following format `[deficient, perfect, abundant]`.
+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--
 
@@ -32,32 +32,38 @@ Implement a function that calculates how many of the integers from `1` to `20,00
 assert(typeof getDPA === 'function');
 ```
 
-`getDPA` should return an array.
+`getDPA(5000)` should return an array.
 
 ```js
-assert(Array.isArray(getDPA(100)));
+assert(Array.isArray(getDPA(5000)));
 ```
 
-`getDPA` return value should have a length of 3.
+`getDPA(5000)` return array should have a length of `3`.
 
 ```js
-assert(getDPA(100).length === 3);
+assert(getDPA(5000).length === 3);
 ```
 
-`getDPA(20000)` should equal [15043, 4, 4953]
+`getDPA(5000)` should return `[3758, 3, 1239]`.
 
 ```js
-assert.deepEqual(getDPA(20000), solution);
+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--
 
-## --after-user-code--
-
-```js
-const solution = [15043, 4, 4953];
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/align-columns.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/align-columns.md
index 45ff5fa2f3..2b58a1e1d8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/align-columns.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/align-columns.md
@@ -8,35 +8,43 @@ 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.
+Given an array 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>
+```js
+const testText = [
+  '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.'
+];
+```
 
 **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>
+- The example input texts lines may, or may not, have trailing dollar characters.
+- All columns should share the same alignment.
+- Consecutive space characters produced adjacent to the end of lines are insignificant for the purposes of the task.
+- Output text will be viewed in a mono-spaced font on a plain text editor or basic terminal. Lines in it should be joined using new line character (`\n`).
+- The minimum space between columns should be computed from the text and not hard-coded.
+- It is not a requirement to add separating characters between or around columns.
+
+For example, one of the lines from the `testText`, after jusitifing to the right, left and center respectivelly:
+
+```js
+'    column        are separated     by     at    least       one space.\n'
+'column     are        separated by     at     least    one       space.\n'
+'  column      are     separated   by     at    least      one    space.\n'
+```
 
 # --hints--
 
@@ -46,22 +54,22 @@ or$center$justified$within$its$column.
 assert(typeof formatText === 'function');
 ```
 
-`formatText` with the above input and "right" justification should produce the following:
+`formatText(testText, 'right')` should produce text with columns justified to the right.
 
 ```js
-assert.strictEqual(formatText(testInput, 'right'), rightAligned);
+assert.strictEqual(formatText(_testText, 'right'), rightAligned);
 ```
 
-`formatText` with the above input and "left" justification should produce the following:
+`formatText(testText, 'left')` should produce text with columns justified to the left.
 
 ```js
-assert.strictEqual(formatText(testInput, 'left'), leftAligned);
+assert.strictEqual(formatText(_testText, 'left'), leftAligned);
 ```
 
-`formatText` with the above input and "center" justification should produce the following:
+`formatText(testText, 'center')` should produce text with columns justified to the center.
 
 ```js
-assert.strictEqual(formatText(testInput, 'center'), centerAligned);
+assert.strictEqual(formatText(_testText, 'center'), centerAligned);
 ```
 
 # --seed--
@@ -69,10 +77,10 @@ assert.strictEqual(formatText(testInput, 'center'), centerAligned);
 ## --after-user-code--
 
 ```js
-const testInput = [
+const _testText = [
   'Given$a$text$file$of$many$lines',
   'where$fields$within$a$line$',
-  'are$delineated$by$a$single$\"dollar\"$character',
+  'are$delineated$by$a$single$"dollar"$character',
   'write$a$program',
   'that$aligns$each$column$of$fields$',
   'by$ensuring$that$words$in$each$',
@@ -119,7 +127,11 @@ const centerAligned = '  Given        a        text     file    of     many
 ## --seed-contents--
 
 ```js
-const testArr = [
+function formatText(input, justification) {
+
+}
+
+const testText = [
   'Given$a$text$file$of$many$lines',
   'where$fields$within$a$line$',
   'are$delineated$by$a$single$"dollar"$character',
@@ -131,28 +143,11 @@ const testArr = [
   '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) {
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/closest-pair-problem.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
index 3ca2081231..9221d424b3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
@@ -8,9 +8,9 @@ dashedName: closest-pair-problem
 
 # --description--
 
-Provide a function to find the closest two points among a set of given points in two dimensions, i.e. to solve the [Closest pair of points problem](https://en.wikipedia.org/wiki/Closest pair of points problem "wp: Closest pair of points problem") in the *planar* case.
+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<sup>2</sup>) algorithm (which we can call *brute-force algorithm*); the pseudo-code (using indexes) could be simply:
+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>
@@ -30,7 +30,7 @@ The straightforward solution is a O(n<sup>2</sup>) algorithm (which we can call
 <strong>endif</strong>
 </pre>
 
-A better algorithm is based on the recursive divide and conquer approach, as explained also at [Wikipedia's Closest pair of points problem](https://en.wikipedia.org/wiki/Closest pair of points problem#Planar_case "wp: Closest pair of points problem#Planar_case"), which is `O(nlog(n))` a pseudo-code could be:
+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
@@ -65,16 +65,38 @@ A better algorithm is based on the recursive divide and conquer approach, as exp
 <strong>endif</strong>
 </pre>
 
-For the input, expect the argument to be an array of objects (points) with `x` and `y` members set to numbers. For the output, return an object containing the key:value pairs for `distance` and `pair` (the pair of two closest points).
+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).
 
-**References and further readings:**
+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.
 
-<ul>
-  <li><a href='https://en.wikipedia.org/wiki/Closest pair of points problem' title='wp: Closest pair of points problem' target='_blank'>Closest pair of points problem</a></li>
-  <li><a href='https://www.cs.mcgill.ca/~cs251/ClosestPair/ClosestPairDQ.html' target='_blank'>Closest Pair (McGill)</a></li>
-  <li><a href='https://www.cs.ucsb.edu/~suri/cs235/ClosestPair.pdf' target='_blank'>Closest Pair (UCSB)</a></li>
-  <li><a href='https://classes.cec.wustl.edu/~cse241/handouts/closestpair.pdf' target='_blank'>Closest pair (WUStL)</a></li>
- </ul>
 
 # --hints--
 
@@ -84,13 +106,13 @@ For the input, expect the argument to be an array of objects (points) with `x` a
 assert(typeof getClosestPair === 'function');
 ```
 
-Distance should be the following.
+`getClosestPair(points1).distance` should be `0.0894096443343775`.
 
 ```js
 assert.equal(getClosestPair(points1).distance, answer1.distance);
 ```
 
-Points should be the following.
+`getClosestPair(points1).pair` should be `[ { x: 7.46489, y: 4.6268 }, { x: 7.46911, y: 4.71611 } ]`.
 
 ```js
 assert.deepEqual(
@@ -99,13 +121,13 @@ assert.deepEqual(
 );
 ```
 
-Distance should be the following.
+`getClosestPair(points2).distance` should be `65.06919393998976`.
 
 ```js
 assert.equal(getClosestPair(points2).distance, answer2.distance);
 ```
 
-Points should be the following.
+`getClosestPair(points2).pair` should be `[ { x: 37134, y: 1963 }, { x: 37181, y: 2008 } ]`.
 
 ```js
 assert.deepEqual(
@@ -114,6 +136,21 @@ assert.deepEqual(
 );
 ```
 
+`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--
@@ -132,14 +169,6 @@ const points1 = [
     new Point(1.45428,  0.087596)
 ];
 
-const points2 = [
-  new Point(37100, 13118),
-  new Point(37134, 1963),
-  new Point(37181, 2008),
-  new Point(37276, 21611),
-  new Point(37307, 9320)
-];
-
 const answer1 = {
   distance: 0.0894096443343775,
   pair: [
@@ -154,6 +183,14 @@ const answer1 = {
   ]
 };
 
+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: [
@@ -168,8 +205,8 @@ const answer2 = {
   ]
 };
 
-const benchmarkPoints = [
-  new Point(16909, 54699),
+const points3 = [
+  new Point(16910, 54699),
   new Point(14773, 61107),
   new Point(95547, 45344),
   new Point(95951, 17573),
@@ -196,7 +233,7 @@ const benchmarkPoints = [
   new Point(70721, 66707),
   new Point(31863, 9837),
   new Point(49358, 30795),
-  new Point(13041, 39745),
+  new Point(13041, 39744),
   new Point(59635, 26523),
   new Point(25859, 1292),
   new Point(1551, 53890),
@@ -220,6 +257,20 @@ const benchmarkPoints = [
   new Point(51090, 52158),
   new Point(48953, 58567)
 ];
+
+const answer3 = {
+  distance: 6754.625082119658,
+  pair: [
+    {
+      x: 46817,
+      y: 64975
+    },
+    {
+      x: 48953,
+      y: 58567
+    }
+  ]
+}
 ```
 
 ## --seed-contents--
@@ -347,7 +398,7 @@ const closestPair = function _closestPair(Px, Py) {
 
     return {
         distance: minDelta,
-        pair: closestPair
+        pair: closestPair.sort((pointA, pointB) => pointA.x - pointB.x)
     };
 };
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
index a0a594031c..e050e0d7d2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
@@ -22,7 +22,7 @@ Demonstrate that it passes the following three test-cases:
 | Input number | Output number             |
 | ------------ | ------------------------- |
 | 7259         | <code>2 hr, 59 sec</code> |
-| 728640059    | <code>1 d</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>
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/count-the-coins.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/count-the-coins.md
index 5d900eb107..3e6bd14d1d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/count-the-coins.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/count-the-coins.md
@@ -30,7 +30,7 @@ There are four types of common coins in [US](https://en.wikipedia.org/wiki/Unite
 
 # --instructions--
 
-Implement a function to determine how many ways there are to make change for a dollar using these common coins (1 dollar = 100 cents)
+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--
 
@@ -40,10 +40,22 @@ Implement a function to determine how many ways there are to make change for a d
 assert(typeof countCoins === 'function');
 ```
 
-`countCoins()` should return 242.
+`countCoins(15)` should return `6`.
 
 ```js
-assert.equal(countCoins(), 242);
+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--
@@ -51,7 +63,7 @@ assert.equal(countCoins(), 242);
 ## --seed-contents--
 
 ```js
-function countCoins() {
+function countCoins(cents) {
 
   return true;
 }
@@ -60,12 +72,11 @@ function countCoins() {
 # --solutions--
 
 ```js
-function countCoins() {
-  let t = 100;
+function countCoins(cents) {
   const operands = [1, 5, 10, 25];
-  const targetsLength = t + 1;
+  const targetsLength = cents + 1;
   const operandsLength = operands.length;
-  t = [1];
+  const t = [1];
 
   for (let a = 0; a < operandsLength; a++) {
     for (let b = 1; b < targetsLength; b++) {
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
index 60d72baa9d..74e9412a08 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
@@ -13,51 +13,82 @@ A given rectangle is made from *m* × *n* squares. If *m* and *n* are not both o
 <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>
-    .g { fill: none; stroke: #ccc }
-    .s, .s2 { fill: #bff; stroke: black; fill-opacity: .4 }
-    .s2 { fill: #fbf }
-    .d { stroke:black; fill:none}
+      .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="m">
-      <g id="h4"><g id="h2">
-      <path id="h" d="m0 10h 640" class="g"/>
-      <use xlink:href="#h" transform="translate(0,20)"/></g>
-      <use xlink:href="#h2" transform="translate(0, 40)"/></g>
-      <use xlink:href="#h4" transform="translate(0,80)"/>
-      <g id="v8"><g id="v4"><g id="v2">
-      <path id="v" d="m10 0v160 m 20 0 v-160" class="g"/>
-      <use xlink:href="#v" transform="translate(40,0)"/></g>
-      <use xlink:href="#v2" transform="translate(80,0)"/></g>
-      <use xlink:href="#v4" transform="translate(160,0)"/></g>
-      <use xlink:href="#v8" transform="translate(320,0)"/></g>
-      <path id="b" d="m0 0h80v60h-80z" class="s"/>
+    <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="#m"/>
-    <g transform="translate(10,10)">
-    <path d="m0 0v40h40v-40z" class="s2"/><path d="m20 0v40" class="d"/>
-    <path d="m60 0v40h40v-40z" class="s2"/><path d="m60 20h40" class="d"/>
-    <g transform="translate(120, 0)">
-    <use xlink:href="#b"/><path d="m0 20h40v20h40" class="d"/></g>
-    <g transform="translate(220, 0)">
-    <use xlink:href="#b"/><path d="m0 40h40v-20h40" class="d"/></g>
-    <g transform="translate(320, 0)">
-    <use xlink:href="#b"/><path d="m20 0v40h20v-20h20v40" class="d"/></g>
-    <g transform="translate(420, 0)">
-    <use xlink:href="#b"/><path d="m60 0v40h-20v-20h-20v40" class="d"/></g>
-    <g transform="translate(20, 80)">
-    <use xlink:href="#b"/><path d="m40 0v60" class="d"/></g>
-    <g transform="translate(120, 80)">
-    <use xlink:href="#b"/><path d="m60 0v20h-20v20h-20v20" class="d"/></g>
-    <g transform="translate(220, 80)">
-    <use xlink:href="#b"/><path d="m20 0v20h20v20h20v20" class="d"/></g>
-    <g transform="translate(320, 80)">
-    <use xlink:href="#b"/><path d="m0 20h20v20h20v-20h20v20h20" class="d"/></g>
-    <g transform="translate(420, 80)">
-    <use xlink:href="#b"/><path d="m0 40h20v-20h20v20h20v-20h20" class="d"/></g>
-    </g></g>
-    </svg>
-  </div>
+    <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--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/date-format.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/date-format.md
index b3d9c7c590..7db6dbebb1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/date-format.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/date-format.md
@@ -8,14 +8,20 @@ dashedName: date-format
 
 # --description--
 
-Return an array with the current date in the formats:
+Return an array with two date strings of the current date with the following specifications:
 
-<ul>
-  <li>2007-11-23</li>
-  <li>Friday, November 23, 2007</li>
-</ul>
+- 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 output: `['2007-11-23', 'Friday, November 23, 2007']`
+Example outputs:
+
+```js
+['2007-11-23', 'Friday, November 23, 2007']
+['2021-3-2', 'Tuesday, March 2, 2021']
+```
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/emirp-primes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/emirp-primes.md
index f8a6d22105..564476da7a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/emirp-primes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/emirp-primes.md
@@ -82,7 +82,7 @@ assert.deepEqual(emirps([7700, 8000], true), [
 ]);
 ```
 
-`emirps([7700,8000],true)` should return `11`
+`emirps([7700,8000],false)` should return `11`
 
 ```js
 assert.deepEqual(emirps([7700, 8000], false), 11);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
index 499a48f0a6..cdc024dab4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
@@ -40,13 +40,7 @@ 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.`
+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:**
 
@@ -61,13 +55,7 @@ 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.`
+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:**
 
@@ -86,13 +74,7 @@ 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.`
+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:**
 
@@ -128,13 +110,7 @@ _1 -> 1
 _+_ ->
 </pre>
 
-Sample text of:
-
-`_1111*11111_`
-
-should generate the output:
-
-`11111111111111111111`
+Sample text of `_1111*11111_` should generate the output `11111111111111111111`
 
 **Ruleset 5:**
 
@@ -164,13 +140,7 @@ B1 -> 1B
 1C1 -> H11
 </pre>
 
-This ruleset should turn
-
-`000000A000000`
-
-into
-
-`00011H1111000`
+This ruleset should turn `000000A000000` into `00011H1111000`
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
index f450b13ddb..0e5a414555 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
@@ -54,7 +54,7 @@ As in other trial division algorithms, the algorithm stops when `2kP+1 > sqrt(N)
 
 # --instructions--
 
-Using the above method find a factor of <code>2<sup>929</sup>-1</code> (aka M929)
+Using the above method find a factor of <code>2<sup>p</sup>-1</code>.
 
 # --hints--
 
@@ -70,19 +70,19 @@ assert(typeof check_mersenne === 'function');
 assert(typeof check_mersenne(3) == 'string');
 ```
 
-`check_mersenne(3)` should return "M3 = 2^3-1 is prime".
+`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 "M23 = 2^23-1 is composite with factor 47".
+`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 "M929 = 2^929-1 is composite with factor 13007
+`check_mersenne(929)` should return the string `M929 = 2^929-1 is composite with factor 13007`.
 
 ```js
 assert.equal(
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hailstone-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
index e7587e2f99..37768d8cd3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
@@ -10,29 +10,18 @@ dashedName: hailstone-sequence
 
 The Hailstone sequence of numbers can be generated from a starting positive integer, `n` by:
 
-<ul>
-  <li>If <code>n</code> is <code>1</code> then the sequence ends</li>
-  <li>If <code>n</code> is <code>even</code> then the next <code>n</code> of the sequence <code>= n/2</code></li>
-  <li>If <code>n</code> is <code>odd</code> then the next <code>n</code> of the sequence <code>= (3 * n) + 1</code></li>
-</ul>
+- 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](https://en.wikipedia.org/wiki/Collatz conjecture "wp: Collatz conjecture") is that the hailstone sequence for any starting number always terminates.
+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--
 
-<ol>
-  <li>Create a routine to generate the hailstone sequence for a number</li>
-  <li>Use the routine to show that the hailstone sequence for the number 27 has 112 elements starting with <code>27, 82, 41, 124</code> and ending with <code>8, 4, 2, 1</code></li>
-  <li>Show the number less than 100,000 which has the longest hailstone sequence together with that sequence's length. (But don't show the actual sequence!)</li>
-</ol>
-
-**See also:**
-
-<ul>
-  <li><a href='https://xkcd.com/710' target='_blank'>xkcd</a> (humourous).</li>
-</ul>
+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--
 
@@ -42,24 +31,36 @@ The hailstone sequence is also known as hailstone numbers (because the values ar
 assert(typeof hailstoneSequence === 'function');
 ```
 
-`hailstoneSequence()` should return `[[27,82,41,124,8,4,2,1], [351, 77031]]`
+`hailstoneSequence(30)` should return an array.
 
 ```js
-assert.deepEqual(hailstoneSequence(), res);
+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--
 
-## --after-user-code--
-
-```js
-const res = [[27, 82, 41, 124, 8, 4, 2, 1], [351, 77031]];
-```
-
 ## --seed-contents--
 
 ```js
-function hailstoneSequence() {
+function hailstoneSequence(limit) {
   const res = [];
 
 
@@ -70,9 +71,7 @@ function hailstoneSequence() {
 # --solutions--
 
 ```js
-function hailstoneSequence () {
-  const res = [];
-
+function hailstoneSequence (limit) {
   function hailstone(n) {
     const seq = [n];
     while (n > 1) {
@@ -82,13 +81,9 @@ function hailstoneSequence () {
     return seq;
   }
 
-  const h = hailstone(27);
-  const hLen = h.length;
-  res.push([...h.slice(0, 4), ...h.slice(hLen - 4, hLen)]);
-
   let n = 0;
   let max = 0;
-  for (let i = 100000; --i;) {
+  for (let i = limit; --i;) {
     const seq = hailstone(i);
     const sLen = seq.length;
 
@@ -97,8 +92,7 @@ function hailstoneSequence () {
       max = sLen;
     }
   }
-  res.push([max, n]);
 
-  return res;
+  return [n, max];
 }
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/happy-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/happy-numbers.md
index 6eb4988539..6cb33dbcaf 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/happy-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/happy-numbers.md
@@ -30,67 +30,67 @@ assert(typeof happy === 'function');
 assert(typeof happy(1) === 'boolean');
 ```
 
-`happy(1)` should return true.
+`happy(1)` should return `true`.
 
 ```js
 assert(happy(1));
 ```
 
-`happy(2)` should return false.
+`happy(2)` should return `false`.
 
 ```js
 assert(!happy(2));
 ```
 
-`happy(7)` should return true.
+`happy(7)` should return `true`.
 
 ```js
 assert(happy(7));
 ```
 
-`happy(10)` should return true.
+`happy(10)` should return `true`.
 
 ```js
 assert(happy(10));
 ```
 
-`happy(13)` should return true.
+`happy(13)` should return `true`.
 
 ```js
 assert(happy(13));
 ```
 
-`happy(19)` should return true.
+`happy(19)` should return `true`.
 
 ```js
 assert(happy(19));
 ```
 
-`happy(23)` should return true.
+`happy(23)` should return `true`.
 
 ```js
 assert(happy(23));
 ```
 
-`happy(28)` should return true.
+`happy(28)` should return `true`.
 
 ```js
 assert(happy(28));
 ```
 
-`happy(31)` should return true.
+`happy(31)` should return `true`.
 
 ```js
 assert(happy(31));
 ```
 
-`happy(32)` should return true:.
+`happy(32)` should return `true`.
 
 ```js
 assert(happy(32));
 ```
 
-`happy(33)` should return false.
+`happy(33)` should return `false`.
 
 ```js
 assert(!happy(33));
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
index 383989816a..400e951334 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
@@ -10,7 +10,7 @@ dashedName: harshad-or-niven-series
 
 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](https://rosettacode.org/wiki/Harshad_or_Niven_series "Harshad or Niven series") as `42` is divisible by `(4 + 2)` without remainder.
+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.
 
@@ -18,7 +18,7 @@ Assume that the series is defined as the numbers in increasing order.
 
 Implement a function to generate successive members of the Harshad sequence.
 
-Use it to list the first twenty members of the sequence and list the first Harshad number greater than 1000.
+Use it to return an array with ten members of the sequence, starting with first Harshad number greater than `n`.
 
 # --hints--
 
@@ -28,32 +28,31 @@ Use it to list the first twenty members of the sequence and list the first Harsh
 assert(typeof isHarshadOrNiven === 'function');
 ```
 
-`isHarshadOrNiven()` should return `{"firstTwenty": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42],"firstOver1000": 1002}`
+`isHarshadOrNiven(10)` should return `[12, 18, 20, 21, 24, 27, 30, 36, 40, 42]`
 
 ```js
-assert.deepEqual(isHarshadOrNiven(), res);
+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--
 
-## --after-user-code--
-
-```js
-const res = {
-  firstTwenty: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42],
-  firstOver1000: 1002
-};
-```
-
 ## --seed-contents--
 
 ```js
-function isHarshadOrNiven() {
-  const res = {
-    firstTwenty: [],
-    firstOver1000: undefined
-  };
-  // Only change code below this line
+function isHarshadOrNiven(n) {
+  const res = [];
 
   return res;
 }
@@ -62,37 +61,27 @@ function isHarshadOrNiven() {
 # --solutions--
 
 ```js
-function isHarshadOrNiven() {
-  const res = {
-    firstTwenty: [],
-    firstOver1000: undefined
-  };
-
-  function isHarshad(n) {
+function isHarshadOrNiven(n) {
+  function isHarshad(num) {
     let s = 0;
-    const nStr = n.toString();
+    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;
-  const harshads = [];
 
-  for (let n = 1; count < 20; ++n) {
+  while (count < 10) {
+    n++;
     if (isHarshad(n)) {
       count++;
-      harshads.push(n);
+      res.push(n);
     }
   }
 
-  res.firstTwenty = harshads;
-
-  let h = 1000;
-  while (!isHarshad(++h));
-  res.firstOver1000 = h;
-
   return res;
 }
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/josephus-problem.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/josephus-problem.md
index 93d7f7876b..6e8314e204 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/josephus-problem.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/josephus-problem.md
@@ -42,34 +42,34 @@ assert(typeof josephus == 'function');
 assert(typeof josephus(30, 3) == 'number');
 ```
 
-`josephus(30,3)` should return `29`.
+`josephus(30,3)` should return `28`.
 
 ```js
-assert.equal(josephus(30, 3), 29);
+assert.equal(josephus(30, 3), 28);
 ```
 
-`josephus(30,5)` should return `3`.
+`josephus(30,5)` should return `2`.
 
 ```js
-assert.equal(josephus(30, 5), 3);
+assert.equal(josephus(30, 5), 2);
 ```
 
-`josephus(20,2)` should return `9`.
+`josephus(20,2)` should return `8`.
 
 ```js
-assert.equal(josephus(20, 2), 9);
+assert.equal(josephus(20, 2), 8);
 ```
 
-`josephus(17,6)` should return `2`.
+`josephus(17,6)` should return `1`.
 
 ```js
-assert.equal(josephus(17, 6), 2);
+assert.equal(josephus(17, 6), 1);
 ```
 
-`josephus(29,4)` should return `2`.
+`josephus(29,4)` should return `1`.
 
 ```js
-assert.equal(josephus(29, 4), 2);
+assert.equal(josephus(29, 4), 1);
 ```
 
 # --seed--
@@ -86,36 +86,13 @@ function josephus(init, kill) {
 
 ```js
 function josephus(init, kill) {
-  var Josephus = {
-    init: function(n) {
-      this.head = {};
-      var current = this.head;
-      for (var i = 0; i < n - 1; i++) {
-        current.label = i + 1;
-        current.next = {
-          prev: current
-        };
-        current = current.next;
-      }
-      current.label = n;
-      current.next = this.head;
-      this.head.prev = current;
-      return this;
-    },
-    kill: function(spacing) {
-      var current = this.head;
-      while (current.next !== current) {
-        for (var i = 0; i < spacing - 1; i++) {
-          current = current.next;
-        }
-        current.prev.next = current.next;
-        current.next.prev = current.prev;
-        current = current.next;
-      }
-      return current.label;
-    }
+  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 Josephus.init(init).kill(kill)
+  return arr[0];
 }
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
index 8cf4a2a372..74e1ad8916 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
@@ -73,7 +73,7 @@ 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)` should return `75300`.
+`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(
@@ -86,7 +86,7 @@ assert.equal(
     35,
     0.35
   ),
-  75300
+  75900
 );
 ```
 
@@ -120,36 +120,66 @@ function knapsackUnbounded(items, maxweight, maxvolume) {
 # --solutions--
 
 ```js
-function knapsackUnbounded(items, maxweight, maxvolume) {
-  var n = items.length;
-  var best_value = 0;
-  var count = new Array(n);
-  var best = new Array(n);
-  function recurseKnapsack(i, value, weight, volume) {
-    var j, m1, m2, m;
-    if (i == n) {
-      if (value > best_value) {
-        best_value = value;
-        for (j = 0; j < n; j++) {
-          best[j] = count[j];
-        }
-      }
-      return;
+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;
     }
-    m1 = Math.floor(weight / items[i].weight);
-    m2 = Math.floor(volume / items[i].volume);
-    m = m1 < m2 ? m1 : m2;
-    for (count[i] = m; count[i] >= 0; count[i]--) {
-      recurseKnapsack(
-        i + 1,
-        value + count[i] * items[i].value,
-        weight - count[i] * items[i].weight,
-        volume - count[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);
     }
   }
 
-  recurseKnapsack(0, 0, maxweight, maxvolume);
-  return best_value;
+  return bestValue;
 }
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knights-tour.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knights-tour.md
index 8551529445..c7a4b0693d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knights-tour.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knights-tour.md
@@ -8,7 +8,7 @@ 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.
+[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--
 
@@ -28,34 +28,34 @@ assert(typeof knightTour == 'function');
 assert(typeof knightTour(6, 6) == 'number');
 ```
 
-`knightTour(6, 6)` should return `35`.
+`knightTour(6, 6)` should return `36`.
 
 ```js
-assert.equal(knightTour(6, 6), 35);
+assert.equal(knightTour(6, 6), 36);
 ```
 
-`knightTour(5, 6)` should return `20`.
+`knightTour(5, 6)` should return `30`.
 
 ```js
-assert.equal(knightTour(5, 6), 20);
+assert.equal(knightTour(5, 6), 30);
 ```
 
-`knightTour(4, 6)` should return `10`.
+`knightTour(4, 6)` should return `12`.
 
 ```js
-assert.equal(knightTour(4, 6), 10);
+assert.equal(knightTour(4, 6), 12);
 ```
 
-`knightTour(7, 3)` should return `4`.
+`knightTour(7, 3)` should return `10`.
 
 ```js
-assert.equal(knightTour(7, 3), 4);
+assert.equal(knightTour(7, 3), 10);
 ```
 
-`knightTour(8, 6)` should return `47`.
+`knightTour(8, 6)` should return `48`.
 
 ```js
-assert.equal(knightTour(8, 6), 47);
+assert.equal(knightTour(8, 6), 48);
 ```
 
 # --seed--
@@ -72,83 +72,154 @@ function knightTour(w, h) {
 
 ```js
 function knightTour(w, h) {
-  var b,
-    cnt = 0;
-
-  var dx = [-2, -2, -1, 1, 2, 2, 1, -1];
-  var dy = [-1, 1, 2, 2, 1, -1, -2, -2];
-
-  function init_board() {
-    var i, j, k, x, y;
-    // * b is board; a is board with 2 rows padded at each side
-
-    for (i = 0; i < h; i++) {
-      for (j = 0; j < w; j++) {
-        b[i][j] = 255;
-      }
+  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];
+  }
 
-    for (i = 0; i < h; i++) {
-      for (j = 0; j < w; j++) {
-        for (k = 0; k < 8; k++) {
-          (x = j + dx[k]), (y = i + dy[k]);
-          if (b[i][j] == 255) b[i][j] = 0;
-          if (x >= 0 && x < w && y >= 0 && y < h) b[i][j]++;
-        }
+  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 walk_board(x, y) {
-    var i, nx, ny, least;
-    var steps = 0;
-    // printf(E"H"E"J"E"%d;%dH"E"32m[]"E"m", y + 1, 1 + 2 * x);
-
-    while (1) {
-      // * occupy cell
-      b[y][x] = 255;
-
-      // * reduce all neighbors' neighbor count
-      for (i = 0; i < 8; i++)
-        if (y + dy[i] >= 0 && x + dx[i] >= 0 && y + dy[i] < h && x + dx[i] < w)
-          b[y + dy[i]][x + dx[i]]--;
-
-      // find neighbor with lowest neighbor count
-      least = 255;
-      for (i = 0; i < 8; i++) {
-        if (y + dy[i] >= 0 && x + dx[i] >= 0 && y + dy[i] < h && x + dx[i] < w)
-          if (b[y + dy[i]][x + dx[i]] < least) {
-            nx = x + dx[i];
-            ny = y + dy[i];
-            least = b[ny][nx];
-          }
+  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]--;
       }
+    }
+  }
 
-      if (least > 7) {
-        return steps == w * h - 1;
+  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]);
       }
-
-      steps++;
-      (x = nx), (y = ny);
     }
+
+    if (bestMoves.length > 0) {
+      return bestMoves;
+    }
+    return zeroMove;
   }
 
-  function solve(x, y) {
-    b = new Array(h);
-    for (var i = 0; i < h; i++) b[i] = new Array(w);
-
-    init_board();
-    if (walk_board(x, y)) {
-      cnt++;
+  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;
   }
 
-  for (var i = 0; i < h; i++) {
-    for (var j = 0; j < w; j++) {
-      solve(j, i);
-    }
+  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);
   }
 
-  return cnt;
+  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/chinese-traditional/10-coding-interview-prep/rosetta-code/letter-frequency.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/letter-frequency.md
index a141607477..d7c0a30349 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/letter-frequency.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/letter-frequency.md
@@ -34,7 +34,7 @@ assert(typeof letterFrequency == 'function');
 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]]`.
+`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'), [
@@ -58,7 +58,7 @@ assert.deepEqual(letterFrequency('Not all that Mrs. Bennet, however'), [
 ]);
 ```
 
-`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]]`.
+`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 '), [
@@ -131,7 +131,7 @@ assert.deepEqual(letterFrequency('in various ways--with barefaced'), [
 ]);
 ```
 
-`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]]`.
+`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'), [
@@ -153,7 +153,7 @@ assert.deepEqual(letterFrequency('distant surmises; but he eluded'), [
 ]);
 ```
 
-`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]]`.
+`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,'), [
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
index 7d168a3673..e8924ccd28 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
@@ -12,11 +12,15 @@ Loop over multiple arrays and create a new array whose $i^{th}$ element is the c
 
 For this example, if you are given this array of arrays:
 
-`[ ["a", "b", "c"], ["A", "B", "C"], [1, 2, 3] ]`
+```js
+[ ["a", "b", "c"], ["A", "B", "C"], [1, 2, 3] ]
+```
 
 the output should be:
 
-`["aA1","bB2","cC3"]`
+```js
+["aA1","bB2","cC3"]
+```
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/s-expressions.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/s-expressions.md
index e7ed94741c..19304897ae 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/s-expressions.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/s-expressions.md
@@ -22,9 +22,9 @@ Newlines and other whitespace may be ignored unless contained within a quoted st
 
 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 "<code>\\</code>" for escaping, but should, in addition, recognize numbers if the language has appropriate data types.
+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 "`()"`" ("<code>\\</code>" if escaping is supported) and whitespace there are no special characters. Anything else is allowed without quotes.
+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
 
@@ -48,7 +48,7 @@ assert(typeof parseSexpr === 'function');
 assert.deepEqual(parseSexpr(simpleSExpr), simpleSolution);
 ```
 
-`parseSexpr('(data1 data2 data3)')` should return an array with 3 elements.
+`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);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sha-256.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sha-256.md
index 83c7fccde3..9ce0ca4260 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sha-256.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sha-256.md
@@ -8,11 +8,11 @@ dashedName: sha-256
 
 # --description--
 
-**[SHA-256](https://en.wikipedia.org/wiki/SHA-256)** is the recommended stronger alternative to [SHA-1](https://rosettacode.org/wiki/SHA-1).
+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--
 
-Write a function that takes a string as a parameter and returns its SHA-256 digest.
+Research implemenation details and write a function that takes a string as the parameter and returns a hash using `SHA-256`
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
index 60e2ee0923..b6647f2824 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
@@ -14,7 +14,9 @@ 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>
 
-`indices(0-based): {6, 1, 7}`
+```js
+indices(0-based): {6, 1, 7}
+```
 
 Where the correct result would be:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
index 0f7bbb37b7..4bb28fba9a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
@@ -11,13 +11,13 @@ dashedName: split-a-character-string-based-on-change-of-character
 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++///\"
+"gHHH5YY++///\\"
 </pre>
 
 should be split as:
 
 <pre>
-["g", "HHH", "5", "YY", "++", "///", "\" ];
+["g", "HHH", "5", "YY", "++", "///", "\\" ];
 </pre>
 
 # --hints--
@@ -80,7 +80,7 @@ assert.deepEqual(split('sssmmmaaammmaaat'), [
 ]);
 ```
 
-`split("gHHH5YY++///\")` should return `["g", "HHH", "5", "YY", "++", "///", "\\"]`.
+`split("gHHH5YY++///\\")` should return `["g", "HHH", "5", "YY", "++", "///", "\\"]`.
 
 ```js
 assert.deepEqual(split('gHHH5YY++///\\'), [
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sudoku.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sudoku.md
index ccf9143f28..e0f6864a89 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sudoku.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sudoku.md
@@ -8,7 +8,7 @@ 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 0s. [Algorithmics of Sudoku](https://en.wikipedia.org/wiki/Algorithmics_of_sudoku) may help implement this.
+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--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-of-a-series.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
index 35fee31774..6ffa6d152f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
@@ -8,7 +8,7 @@ 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 = \\sum*{k=1}^n \\frac{1}{k^2}$ and compute $S\_{1000}$ This approximates the [zeta function](https://en.wikipedia.org/wiki/Riemann zeta function) for S=2, whose exact value $\\zeta(2) = {\\pi^2\\over 6}$ is the solution of the [Basel problem](https://en.wikipedia.org/wiki/Basel problem).
+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--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-to-100.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-to-100.md
index 1cd0f58a71..f30b422ba8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-to-100.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-to-100.md
@@ -60,16 +60,6 @@ assert.deepEqual(sumTo100(243), [
 ]);
 ```
 
-`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(197)` should return `["1-2-3+45+67+89", "12+34-5+67+89", "123+4-5+6+78-9"]`.
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/top-rank-per-group.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
index c9405c8f3f..56cd284379 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
@@ -12,7 +12,8 @@ Find the top `n` ranked data in each group, where `n` is provided as a parameter
 
 Given the following data:
 
-<pre>[
+```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' },
@@ -27,29 +28,56 @@ Given the following data:
   { name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D190' },
   { name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D190' }
 ];
-</pre>
+```
 
-one could rank top 10 employees in each department by calling
+One could rank top 10 employees in each department by calling:
 
-`topRankPerGroup(10, data, 'dept', 'salary')`
+```js
+topRankPerGroup(10, testData1, 'dept', 'salary')
+```
 
 Given the following data:
 
-<pre>[
+```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 }
 ];
-</pre>
+```
 
-one could rank the top-rated movie in each genre by calling
+One could rank the top-rated movie in each genre by calling:
 
-`topRankPerGroup(1, data, 'genre', 'rating')`
+```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.
@@ -64,22 +92,16 @@ assert(typeof topRankPerGroup === 'function');
 assert(typeof topRankPerGroup(-1, []) === 'undefined');
 ```
 
-First department should be D050
+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.equal(res1[0][0].dept, 'D050');
+assert.deepEqual(res1[0][0], { name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050'});
 ```
 
-First department should be 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.equal(res1[0][1].salary, 21900);
-```
-
-The last department should be D202
-
-```js
-assert.equal(res1[3][3].dept, 'D202');
+assert.deepEqual(res1[3][3], { name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' });
 ```
 
 `topRankPerGroup(1, ...)` should return only top ranking result per group.
@@ -88,7 +110,7 @@ assert.equal(res1[3][3].dept, 'D202');
 assert.equal(res2[2].length, 1);
 ```
 
-`topRankPerGroup(1, ...)` should return only top ranking result per group.
+`topRankPerGroup(2, ...)` should return two ranking results per group.
 
 ```js
 assert.equal(res3[2][1].name, 'Maze Runner');
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/topological-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/topological-sort.md
index 1f091c8bf9..f57d218e66 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/topological-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/topological-sort.md
@@ -8,19 +8,19 @@ dashedName: topological-sort
 
 # --description--
 
-Given a mapping between items, and items they depend on, a [topological sort](https://en.wikipedia.org/wiki/Topological sorting "wp: Topological sorting") orders items so that no item precedes an item it depends upon. The compiling of a library in the [VHDL](https://en.wikipedia.org/wiki/VHDL "wp: VHDL") language has the constraint that a library must be compiled after any library it depends on.
+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 valid compile order of VHDL libraries from their dependencies.
+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.
 
-<ul>
-  <li>Assume library names are single words.</li>
-  <li>Items mentioned as only dependents have no dependents of their own, but their order of compiling must be given.</li>
-  <li>Any self dependencies should be ignored.</li>
-  <li>Any un-orderable dependencies should be ignored.</li>
-</ul>
 Use the following data as an example:
+
 <pre>
 LIBRARY          LIBRARY DEPENDENCIES
 =======          ====================
@@ -38,16 +38,18 @@ ramlib           std ieee
 std_cell_lib     ieee std_cell_lib
 synopsys
 </pre>
-<small>Note: the above data would be un-orderable if, for example, <code>dw04</code> is added to the list of dependencies of <code>dw01</code>.</small>
-<strong>C.f.:</strong>
-<ul>
-  <li><a href="https://rosettacode.org/wiki/Topological sort/Extracted top item" title="Topological sort/Extracted top item" target="_blank">Topological sort/Extracted top item</a>.</li>
-</ul>
-There are two popular algorithms for topological sorting:
-<ul>
-  <li><a href="https://en.wikipedia.org/wiki/Topological sorting" title="wp: Topological sorting" target="_blank">Kahn's 1962 topological sort</a></li>
-  <li><a href="https://www.embeddedrelated.com/showarticle/799.php" target="_blank">depth-first search</a></li>
-</ul>
+
+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--
 
@@ -57,28 +59,34 @@ There are two popular algorithms for topological sorting:
 assert(typeof topologicalSort === 'function');
 ```
 
-`topologicalSort` should return correct library order.
+`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` should return correct library order.
+`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), solutionVHDL);
+assert.deepEqual(topologicalSort(libsVHDL), ['ieee', 'std_cell_lib', 'gtech', 'dware', 'dw07', 'dw06', 'dw05', 'dw02', 'dw01', 'dw04', 'std', 'ramlib', 'synopsys', 'dw03', 'des_system_lib']);
 ```
 
-`topologicalSort` should return correct library order.
+`topologicalSort(libsCustom)` should return `['base', 'c', 'd', 'b', 'a']`.
 
 ```js
-assert.deepEqual(topologicalSort(libsCustom), solutionCustom);
+assert.deepEqual(topologicalSort(libsCustom), ['base', 'c', 'd', 'b', 'a']);
 ```
 
 `topologicalSort` should ignore unorderable dependencies.
 
 ```js
-assert.deepEqual(topologicalSort(libsUnorderable), solutionUnorderable);
+assert.deepEqual(topologicalSort(libsUnorderable), ['Base']);
 ```
 
 # --seed--
@@ -105,26 +113,17 @@ const libsVHDL =
   std_cell_lib     ieee std_cell_lib
   synopsys`;
 
-const solutionVHDL = [
-  'ieee', 'std_cell_lib', 'gtech', 'dware', 'dw07', 'dw06',
-  'dw05', 'dw02', 'dw01', 'dw04', 'std', 'ramlib', 'synopsys',
-  'dw03', 'des_system_lib'
-];
-
 const libsCustom =
   `a b c d
   b c d
   d c
   c base
   base`;
-const solutionCustom = ['base', 'c', 'd', 'b', 'a'];
 
 const libsUnorderable =
   `TestLib Base MainLib
   MainLib TestLib
   Base`;
-
-const solutionUnorderable = ['Base'];
 ```
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/vector-cross-product.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/vector-cross-product.md
index b7a9d18be1..4dab99b445 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/vector-cross-product.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/vector-cross-product.md
@@ -16,19 +16,19 @@ Write a function that takes two vectors (arrays) as input and computes their cro
 
 # --hints--
 
-dotProduct should be a function.
+`crossProduct` should be a function.
 
 ```js
 assert.equal(typeof crossProduct, 'function');
 ```
 
-dotProduct() should return null.
+`crossProduct()` should return null.
 
 ```js
 assert.equal(crossProduct(), null);
 ```
 
-crossProduct([1, 2, 3], [4, 5, 6]) should return [-3, 6, -3].
+`crossProduct([1, 2, 3], [4, 5, 6])` should return `[-3, 6, -3]`.
 
 ```js
 assert.deepEqual(res12, exp12);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
index 35c7529bc4..7794021986 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
@@ -14,42 +14,145 @@ The decimal number eleven can be written as `0*13 + 1*8 + 0*5 + 1*3 + 0*2 + 0*1`
 
 # --instructions--
 
-Write a function that generates and returns an array of the first `n` Zeckendorf numbers in order.
+Write a function that generates and returns the Zeckendorf number representation of `n`.
 
 # --hints--
 
-zeckendorf should be function.
+`zeckendorf` should be a function.
 
 ```js
 assert.equal(typeof zeckendorf, 'function');
 ```
 
-Your `zeckendorf` function should return the correct answer.
+`zeckendorf(0)` should return `0`.
 
 ```js
-assert.deepEqual(answer, solution20);
+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--
 
-## --after-user-code--
-
-```js
-const range = (m, n) => (
-  Array.from({
-    length: Math.floor(n - m) + 1
-  }, (_, i) => m + i)
-);
-
-const solution20 = [
-  '1', '10', '100', '101', '1000', '1001', '1010', '10000', '10001',
-  '10010', '10100', '10101', '100000', '100001', '100010', '100100', '100101',
-  '101000', '101001', '101010'
-];
-
-const answer = range(1, 20).map(zeckendorf);
-```
-
 ## --seed-contents--
 
 ```js
@@ -61,13 +164,13 @@ function zeckendorf(n) {
 # --solutions--
 
 ```js
-// zeckendorf :: Int -> String
+// zeckendorf :: Int -> Int
 function zeckendorf(n) {
   const f = (m, x) => (m < x ? [m, 0] : [m - x, 1]);
-  return (n === 0 ? ([0]) :
+  return parseInt((n === 0 ? ([0]) :
     mapAccumL(f, n, reverse(
       tail(fibUntil(n))
-    ))[1]).join('');
+    ))[1]).join(''));
 }
 
 // fibUntil :: Int -> [Int]
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
index bad53c8710..d3970f2f72 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
@@ -10,87 +10,68 @@ dashedName: zhang-suen-thinning-algorithm
 
 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>
+```js
+const testImage1 = [
+ '                               ',
+ '#########       ########       ',
+ '###   ####     ####  ####      ',
+ '###    ###     ###    ###      ',
+ '###   ####     ###             ',
+ '#########      ###             ',
+ '### ####       ###    ###      ',
+ '###  ####  ### ####  #### ###  ',
+ '###   #### ###  ########  ###  ',
+ '                               '
+];
+```
 
 It produces the thinned output:
 
-<pre>
+```js
+[ '                               ',
+  '########         ######        ',
+  '#      #        ##             ',
+  '#       #       #              ',
+  '#      #        #              ',
+  '###### #        #              ',
+  '#     ##        #              ',
+  '#      #    #   ##    ##   #   ',
+  '#       #         ####         ',
+  '                               ' ];
+```
 
-    # ##########                       #######
-     ##        #                   ####       #
-     #          #                 ##
-     #          #                #
-     #          #                #
-     #          #                #
-     ############               #
-     #          #               #
-     #          #                #
-     #          #                #
-     #          #                #
-     #                            ##
-     #                             ############
-                       ###                          ###
-
-</pre>
-
-<h2>Algorithm</h2>
+## Algorithm
 
 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>
+$$\begin{array}{|c|c|c|} \\hline P9 & P2              & P3\\\\ \\hline P8 & \boldsymbol{P1} & P4\\\\ \\hline P7 & P6              & P5\\\\ \\hline \end{array}$$
 
 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>
+- Define $A(P1)$ = the number of transitions from white to black, ($0 \to 1$) in the sequence P2, P3, P4, P5, P6, P7, P8, P9, P2. (Note the extra P2 at the end - it is circular).
+- Define $B(P1)$ = the number of black pixel neighbours of P1. ($= \\sum(P2 \ldots P9)$)
 
 **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>
+All pixels are tested and pixels satisfying all the following conditions (simultaneously) are just noted at this stage.
+
+1. The pixel is black and has eight neighbours
+2. $2 \le B(P1) \le 6$
+3. $A(P1) = 1$
+4. At least one of $P2$, $P4$ and $P6$ is white
+5. At least one of $P4$, $P6$ and $P8$ is white
 
 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>
+All pixels are again tested and pixels satisfying all the following conditions are just noted at this stage.
+
+1. The pixel is black and has eight neighbours
+2. $2 \le B(P1) \le 6$
+3. $A(P1) = 1$
+4. At least one of $P2$, $P4$ and $P8$ is white
+5. At least one of $P2$, $P6$ and $P8$ is white
 
 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.
 
@@ -100,7 +81,7 @@ If any pixels were set in this round of either step 1 or step 2 then all steps a
 
 # --instructions--
 
-Write a routine to perform Zhang-Suen thinning on the provided image matrix.
+Write a routine to perform Zhang-Suen thinning on the provided `image`, an array of strings, where each string represents single line of the image. In the string, `#` represents black pixel, and whitespace represents white pixel. Function should return thinned image, using the same representation.
 
 # --hints--
 
@@ -113,19 +94,25 @@ assert.equal(typeof thinImage, 'function');
 `thinImage` should return an array.
 
 ```js
-assert(Array.isArray(result));
+assert(Array.isArray(thinImage(_testImage1)));
 ```
 
 `thinImage` should return an array of strings.
 
 ```js
-assert.equal(typeof result[0], 'string');
+assert.equal(typeof thinImage(_testImage1)[0], 'string');
 ```
 
-`thinImage` should return an array of strings.
+`thinImage(testImage1)` should return a thinned image as in the example.
 
 ```js
-assert.deepEqual(result, expected);
+assert.deepEqual(thinImage(_testImage1), expected1);
+```
+
+`thinImage(testImage2)` should return a thinned image.
+
+```js
+assert.deepEqual(thinImage(_testImage2), expected2);
 ```
 
 # --seed--
@@ -133,7 +120,31 @@ assert.deepEqual(result, expected);
 ## --after-user-code--
 
 ```js
-const imageForTests = [
+const _testImage1 = [
+  '                               ',
+  '#########       ########       ',
+  '###   ####     ####  ####      ',
+  '###    ###     ###    ###      ',
+  '###   ####     ###             ',
+  '#########      ###             ',
+  '### ####       ###    ###      ',
+  '###  ####  ### ####  #### ###  ',
+  '###   #### ###  ########  ###  ',
+  '                               '
+];
+const expected1 = [
+  '                               ',
+  '########         ######        ',
+  '#      #        ##             ',
+  '#       #       #              ',
+  '#      #        #              ',
+  '###### #        #              ',
+  '#     ##        #              ',
+  '#      #    #   ##    ##   #   ',
+  '#       #         ####         ',
+  '                               '
+];
+const _testImage2 = [
   '                                                          ',
   ' #################                   #############        ',
   ' ##################               ################        ',
@@ -152,7 +163,7 @@ const imageForTests = [
   ' ########     ####### ######      ################ ###### ',
   ' ########     ####### ######         ############# ###### ',
   '                                                          '];
-const expected = [
+const expected2 = [
   '                                                          ',
   '                                                          ',
   '    # ##########                       #######            ',
@@ -172,35 +183,27 @@ const expected = [
   '                                                          ',
   '                                                          '
 ];
-const result = thinImage(imageForTests);
 ```
 
 ## --seed-contents--
 
 ```js
-const testImage = [
-  '                                                          ',
-  ' #################                   #############        ',
-  ' ##################               ################        ',
-  ' ###################            ##################        ',
-  ' ########     #######          ###################        ',
-  '   ######     #######         #######       ######        ',
-  '   ######     #######        #######                      ',
-  '   #################         #######                      ',
-  '   ################          #######                      ',
-  '   #################         #######                      ',
-  '   ######     #######        #######                      ',
-  '   ######     #######        #######                      ',
-  '   ######     #######         #######       ######        ',
-  ' ########     #######          ###################        ',
-  ' ########     ####### ######    ################## ###### ',
-  ' ########     ####### ######      ################ ###### ',
-  ' ########     ####### ######         ############# ###### ',
-  '                                                          '];
-
 function thinImage(image) {
 
 }
+
+const testImage1 = [
+  '                               ',
+  '#########       ########       ',
+  '###   ####     ####  ####      ',
+  '###    ###     ###    ###      ',
+  '###   ####     ###             ',
+  '#########      ###             ',
+  '### ####       ###    ###      ',
+  '###  ####  ### ####  #### ###  ',
+  '###   #### ###  ########  ###  ',
+  '                               '
+];
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
index 0cf1a3d2f7..bd190875b3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
@@ -8,7 +8,7 @@ dashedName: build-a-pinterest-clone
 
 # --description--
 
-**Objective:** Build a [Repl.it](https://repl.it/) app that is functionally similar to this: <https://build-a-pinterest-clone.freecodecamp.rocks/>.
+**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.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-simon-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
index 9de29f1566..5bc458abb1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
@@ -8,7 +8,7 @@ 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/).
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: [https://codepen.io/freeCodeCamp/full/obYBjE](https://codepen.io/freeCodeCamp/full/obYBjE).
 
 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.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
index 3a0f2e0cd9..5a5420d771 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
@@ -8,7 +8,7 @@ dashedName: manage-a-book-trading-club
 
 # --description--
 
-**Objective:** Build a [Repl.it](https://repl.it/) app that is functionally similar to this: <https://manage-a-book-trading-club.freecodecamp.rocks/>.
+**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.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
index 0f7eaa434e..6070f83ea8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
@@ -8,7 +8,7 @@ dashedName: p2p-video-chat-application
 
 # --description--
 
-**Objective:** Build a [Repl.it](https://repl.it/) app that is functionally similar to this: <https://p2p-video-chat-application.freecodecamp.rocks/>.
+**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.
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md
index 7d7338ee65..3b8a0b6250 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0e9ef99a403d019610cc
-title: Deep Learning Demystified
+title: 解密深度學習
 challengeType: 11
 videoId: bejQ-W9BGJg
 dashedName: deep-learning-demystified
@@ -10,23 +10,23 @@ dashedName: deep-learning-demystified
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md
index b06b2fbed8..91dece48cc 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0e9ef99a403d019610cd
-title: How Convolutional Neural Networks work
+title: 卷積神經網絡的工作原理
 challengeType: 11
 videoId: Y5M7KH4A4n4
 dashedName: how-convolutional-neural-networks-work
@@ -10,19 +10,19 @@ dashedName: how-convolutional-neural-networks-work
 
 ## --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.
+如果你的數據是由 2D 或者 3D 圖片組成的。
 
 ---
 
-If your data is text or sound based.
+如果你的數據是基於文本或者音頻的形式。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md
index ae41c9be52..a8b7fead24 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0e9ef99a403d019610ca
-title: How Deep Neural Networks Work
+title: 深度神經網絡的工作原理
 challengeType: 11
 videoId: zvalnHWGtx4
 dashedName: how-deep-neural-networks-work
@@ -10,19 +10,19 @@ dashedName: how-deep-neural-networks-work
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md
index ab702e9b66..933eb7e32d 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a0e9ef99a403d019610cb
-title: Recurrent Neural Networks RNN and Long Short Term Memory LSTM
+title: 循環神經網絡 RNN 和長短期記憶 LSTM
 challengeType: 11
 videoId: UVimlsy9eW0
 dashedName: recurrent-neural-networks-rnn-and-long-short-term-memory-lstm
@@ -10,19 +10,19 @@ dashedName: recurrent-neural-networks-rnn-and-long-short-term-memory-lstm
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
index b7c5457955..4cbdb1f42f 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
@@ -1,25 +1,26 @@
 ---
 id: 5e46f8e3ac417301a38fb92f
-title: Book Recommendation Engine using KNN
+title: 基於 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.
+在這個挑戰中，你將使用 K-近鄰算法創建一個書籍推薦算法。
 
-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.
+你將使用 Book-Crossings 數據集。 該數據集包括 90,000 名用戶對 270,000 冊書籍的 110 萬份評分（評分從 1至 10）。
 
-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).
+你可以[在 Replit 上查看整個項目的具體描述和初始代碼](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."
+進入該鏈接後，在你自己的賬戶或本地創建一個筆記本的副本。 一旦你完成項目並通過鏈接中的測試，請在下面提交你的項目鏈接。 如果你提交的是 Google Colaboratory 的鏈接，請確保打開鏈接共享時選擇 “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.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
index 76e92dcfb2..63788626c3 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
@@ -1,23 +1,24 @@
 ---
 id: 5e46f8dcac417301a38fb92e
-title: Cat and Dog Image Classifier
+title: 貓狗圖像分類器
 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.
+在這個挑戰中，你將使用 TensorFlow 2.0 和 Keras 創建一個卷積神經網絡，對貓和狗的圖像進行正確分類，準確率至少達到 63%。
 
-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).
+你可以訪問 [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."
+進入該鏈接後，在你自己的賬戶或本地創建一個筆記本的副本。 一旦你完成項目並通過鏈接中的測試，請在下面提交你的項目鏈接。 如果你提交的是 Google Colaboratory 的鏈接，請確保打開鏈接共享時選擇 “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.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
index d0b92385ed..0b75035666 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
@@ -1,25 +1,26 @@
 ---
 id: 5e46f8edac417301a38fb930
-title: Linear Regression Health Costs Calculator
+title: 線性迴歸健康成本計算器
 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).
+你可以訪問 [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."
+進入該鏈接後，在你自己的賬戶或本地創建一個筆記本的副本。 一旦你完成項目並通過鏈接中的測試，請在下面提交你的項目鏈接。 如果你提交的是 Google Colaboratory 的鏈接，請確保打開鏈接共享時選擇 “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.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
index f938843a59..b7d8dd33b9 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
@@ -1,23 +1,24 @@
 ---
 id: 5e46f8edac417301a38fb931
-title: Neural Network SMS Text Classifier
+title: 神經網絡短信文本分類器
 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.
+在這個挑戰中，你需要創建一個機器學習模型，將短信分類爲 “ham” 或 “spam”。 “ham” 信息是由一個朋友發送的普通信息。 “spam” 是一個公司發送的廣告或信息。
 
-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).
+你可以訪問 [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."
+進入該鏈接後，在你自己的賬戶或本地創建一個筆記本的副本。 一旦你完成項目並通過鏈接中的測試，請在下面提交你的項目鏈接。 如果你提交的是 Google Colaboratory 的鏈接，請確保打開鏈接共享時選擇 “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.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
index 5685211ac4..6e9ac405db 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
@@ -1,23 +1,24 @@
 ---
 id: 5e46f8d6ac417301a38fb92d
-title: Rock Paper Scissors
+title: 剪刀石頭布
 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.
+在這個挑戰中，你將創建一個程序來玩石頭、剪刀、布。 一個隨機選取的程序通常會有 50% 的時間獲勝。 要通過這一挑戰，你的程序必須與四個不同的機器人進行對戰，並達到至少 60% 勝率。
 
-You can access [the full project description and starter code on repl.it](https://repl.it/github/freeCodeCamp/boilerplate-rock-paper-scissors).
+你可以訪問 [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.
+進入該鏈接後，fork 該項目。 一旦你根據 “README.md” 中的說明完成了項目，請在下面提交你的項目鏈接。
 
-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.
+它應該通過所有的 Python 測試。
 
 ```js
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/conclusion.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/conclusion.md
index b87ca8022b..eac7eced5f 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/conclusion.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/conclusion.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72da6
-title: Conclusion
+title: 結論
 challengeType: 11
 videoId: LMNub5frQi4
 dashedName: conclusion
@@ -10,19 +10,19 @@ dashedName: conclusion
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md
index 71a466e2b5..628d687311 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d99
-title: 'Convolutional Neural Networks: Evaluating the Model'
+title: '卷積神經網絡：評估模型'
 challengeType: 11
 videoId: eCATNvwraXg
 dashedName: convolutional-neural-networks-evaluating-the-model
@@ -10,19 +10,19 @@ dashedName: convolutional-neural-networks-evaluating-the-model
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md
index 9d34c0b25a..b84f66bc5c 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d9a
-title: 'Convolutional Neural Networks: Picking a Pretrained Model'
+title: '卷積神經網絡：選擇預訓練模型'
 challengeType: 11
 videoId: h1XUt1AgIOI
 dashedName: convolutional-neural-networks-picking-a-pretrained-model
@@ -10,7 +10,7 @@ dashedName: convolutional-neural-networks-picking-a-pretrained-model
 
 ## --text--
 
-Fill in the blanks below to use Google's pre-trained MobileNet V2 model as a base for a convolutional neural network:
+填寫下面的空白，使用谷歌預訓練的 MobileNet V2 模型作爲卷積神經網絡的基礎：
 
 ```py
 base_model = tf.__A__.applications.__B__(input_shape=(160, 160, 3),
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
index 87c0b9ef9b..3ca22167a6 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d97
-title: 'Convolutional Neural Networks: The Convolutional Layer'
+title: '卷積神經網絡：卷積層'
 challengeType: 11
 videoId: LrdmcQpTyLw
 dashedName: convolutional-neural-networks-the-convolutional-layer
@@ -10,19 +10,19 @@ dashedName: convolutional-neural-networks-the-convolutional-layer
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md
index 616ef13476..a715b050d4 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d96
-title: Convolutional Neural Networks
+title: 卷積神經網絡
 challengeType: 11
 videoId: _1kTP7uoU9E
 dashedName: convolutional-neural-networks
@@ -10,19 +10,19 @@ dashedName: convolutional-neural-networks
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
index 4b792df4cd..603ef3c76a 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d8e
-title: 'Core Learning Algorithms: Building the Model'
+title: '核心學習算法：構建模型'
 challengeType: 11
 videoId: 5wHw8BTd2ZQ
 dashedName: core-learning-algorithms-building-the-model
@@ -10,7 +10,7 @@ dashedName: core-learning-algorithms-building-the-model
 
 ## --text--
 
-What kind of estimator/model does TensorFlow recommend using for classification?
+TensorFlow 推薦使用哪種估計器/模型進行分類？
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
index 245cf7febe..ae8f273aad 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d8d
-title: 'Core Learning Algorithms: Classification'
+title: '核心學習算法：分類'
 challengeType: 11
 videoId: qFF7ZQNvK9E
 dashedName: core-learning-algorithms-classification
@@ -10,19 +10,19 @@ dashedName: core-learning-algorithms-classification
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
index 0f8065dedc..020ffa8392 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d8f
-title: 'Core Learning Algorithms: Clustering'
+title: '核心學習算法：聚類'
 challengeType: 11
 videoId: 8sqIaHc9Cz4
 dashedName: core-learning-algorithms-clustering
@@ -10,27 +10,27 @@ dashedName: core-learning-algorithms-clustering
 
 ## --text--
 
-Which of the following steps is **not** part of the K-Means algorithm?
+以下哪個步驟 **不是** K-Means 算法的一部分？
 
 ## --answers--
 
-Randomly pick K points to place K centeroids.
+隨機選取 K 個點放置 K 個質心。
 
 ---
 
-Assign each K point to the closest K centeroid.
+將每個 K 點分配給最近的 K 質心。
 
 ---
 
-Move each K centeroid into the middle of all of their data points.
+將每個 K 質心移動到其所有數據點的中間。
 
 ---
 
-Shuffle the K points so they're redistributed randomly.
+打亂 K 點，使它們隨機重新分配。
 
 ---
 
-Reassign each K point to the closest K centeroid.
+重新分配每個 K 點給最近的 K 質心。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
index b829085f33..9262c86abb 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d90
-title: 'Core Learning Algorithms: Hidden Markov Models'
+title: '核心學習算法：隱馬爾可夫模型'
 challengeType: 11
 videoId: IZg24y4wEPY
 dashedName: core-learning-algorithms-hidden-markov-models
@@ -10,19 +10,19 @@ dashedName: core-learning-algorithms-hidden-markov-models
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
index 29ca4b4896..cec4df545e 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d8c
-title: 'Core Learning Algorithms: The Training Process'
+title: '核心學習算法：訓練過程'
 challengeType: 11
 videoId: _cEwvqVoBhI
 dashedName: core-learning-algorithms-the-training-process
@@ -10,19 +10,19 @@ dashedName: core-learning-algorithms-the-training-process
 
 ## --text--
 
-What are epochs?
+什麼是 epoch？
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
index d31d7425eb..c737140ca2 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d8b
-title: 'Core Learning Algorithms: Training and Testing Data'
+title: '核心學習算法：訓練和測試數據'
 challengeType: 11
 videoId: wz9J1slsi7I
 dashedName: core-learning-algorithms-training-and-testing-data
@@ -10,19 +10,19 @@ dashedName: core-learning-algorithms-training-and-testing-data
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
index 2f77b3c6ea..a6a966c873 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d91
-title: 'Core Learning Algorithms: Using Probabilities to make Predictions'
+title: '核心學習算法：使用概率進行預測'
 challengeType: 11
 videoId: fYAYvLUawnc
 dashedName: core-learning-algorithms-using-probabilities-to-make-predictions
@@ -10,7 +10,7 @@ dashedName: core-learning-algorithms-using-probabilities-to-make-predictions
 
 ## --text--
 
-What TensorFlow module should you import to implement `.HiddenMarkovModel()`?
+你應該導入什麼 TensorFlow 模塊來實現 `.HiddenMarkovModel()`？
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
index bd2c0c44f1..52e066146c 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d8a
-title: 'Core Learning Algorithms: Working with Data'
+title: '核心學習算法：處理數據'
 challengeType: 11
 videoId: u85IOSsJsPI
 dashedName: core-learning-algorithms-working-with-data
@@ -10,19 +10,19 @@ dashedName: core-learning-algorithms-working-with-data
 
 ## --text--
 
-What does the pandas `.head()` function do?
+Pandas 的 `.head()` 函數有什麼作用？
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
index 470a5db663..5064f36174 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d89
-title: Core Learning Algorithms
+title: 核心學習算法
 challengeType: 11
 videoId: u5lZURgcWnU
 dashedName: core-learning-algorithms
@@ -10,25 +10,25 @@ dashedName: core-learning-algorithms
 
 ## --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.
+你擁有過去 100 年三月份的平均溫度。 使用此數據，你希望預測 5 年後 3 月的平均溫度。
 
 ## --answers--
 
-Multiple regression
+多重回歸
 
 ---
 
-Correlation
+關連
 
 ---
 
-Decision tree
+決策樹
 
 ---
 
-Linear regression
+線性迴歸
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md
index 68999197b2..beec45ceb7 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d98
-title: Creating a Convolutional Neural Network
+title: 創建卷積神經網絡
 challengeType: 11
 videoId: kfv0K8MtkIc
 dashedName: creating-a-convolutional-neural-network
@@ -10,7 +10,7 @@ dashedName: creating-a-convolutional-neural-network
 
 ## --text--
 
-Fill in the blanks below to complete the architecture for a convolutional neural network:
+填寫下面的空白以完成卷積神經網絡的架構：
 
 ```py
 model = models.__A__()
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
index 185278bb1e..14b5e5607b 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d87
-title: 'Introduction: Machine Learning Fundamentals'
+title: '簡介：機器學習基礎'
 challengeType: 11
 videoId: KwL1qTR5MT8
 dashedName: introduction-machine-learning-fundamentals
@@ -10,19 +10,19 @@ dashedName: introduction-machine-learning-fundamentals
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
index cefca2bfe2..c2acb1c74d 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d88
-title: Introduction to TensorFlow
+title: TensorFlow 簡介
 challengeType: 11
 videoId: r9hRyGGjOgQ
 dashedName: introduction-to-tensorflow
@@ -10,11 +10,11 @@ dashedName: introduction-to-tensorflow
 
 ## --text--
 
-Which of the following is **not** a type of tensor?
+以下哪個 **不是** 張量的類型？
 
 ## --answers--
 
-Variable
+變量
 
 ---
 
@@ -22,15 +22,15 @@ Flowing
 
 ---
 
-Placeholder
+佔位符
 
 ---
 
-SparseTensor
+稀疏張量
 
 ---
 
-Constant
+常量
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
index 7b7546ba33..0d21bda27e 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72da1
-title: 'Natural Language Processing With RNNs: Building the Model'
+title: '使用 RNN 處理自然語言：構建模型'
 challengeType: 11
 videoId: 32WBFS7lfsw
 dashedName: natural-language-processing-with-rnns-building-the-model
@@ -10,7 +10,7 @@ dashedName: natural-language-processing-with-rnns-building-the-model
 
 ## --text--
 
-Fill in the blanks below to complete the `build_model` function:
+填寫下面的空白以完成 `build_model` 函數：
 
 ```py
 def build_mode(vocab_size, embedding_dim, rnn_units, batch_size):
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
index 9ea1c8ae2a..c0a3eefa5b 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72da0
-title: 'Natural Language Processing With RNNs: Create a Play Generator'
+title: '使用 RNN 進行自然語言處理：創建戲劇生成器'
 challengeType: 11
 videoId: j5xsxjq_Xk8
 dashedName: natural-language-processing-with-rnns-create-a-play-generator
@@ -10,7 +10,7 @@ dashedName: natural-language-processing-with-rnns-create-a-play-generator
 
 ## --text--
 
-Fill in the blanks below to create the training examples for the RNN:
+填寫下面的空白以創建 RNN 的訓練示例：
 
 ```py
 char_dataset = tf.data.__A__.__B__(text_as_int)
@@ -18,7 +18,7 @@ char_dataset = tf.data.__A__.__B__(text_as_int)
 
 ## --answers--
 
-A: `DataSet`
+A: `Dataset`
 
 B: `from_tensor_slices`
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
index 29dbc05f8d..251f1b6fcb 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d9f
-title: 'Natural Language Processing With RNNs: Making Predictions'
+title: '使用 RNN 進行自然語言處理：進行預測'
 challengeType: 11
 videoId: WO1hINnBj20
 dashedName: natural-language-processing-with-rnns-making-predictions
@@ -10,19 +10,19 @@ dashedName: natural-language-processing-with-rnns-making-predictions
 
 ## --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.
+將 0 和數據集中最大詞彙量之間的值，隨機分配給你的評論中的每個單詞。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
index c572d154e1..d01c770363 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d9c
-title: 'Natural Language Processing With RNNs: Part 2'
+title: '使用 RNN 進行自然語言處理：第 2 部分'
 challengeType: 11
 videoId: mUU9YXOFbZg
 dashedName: natural-language-processing-with-rnns-part-2
@@ -10,19 +10,19 @@ dashedName: natural-language-processing-with-rnns-part-2
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
index e3d8d7e263..ece8874ddd 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d9d
-title: 'Natural Language Processing With RNNs: Recurring Neural Networks'
+title: '使用 RNN 進行自然語言處理：循環神經網絡'
 challengeType: 11
 videoId: bX5681NPOcA
 dashedName: natural-language-processing-with-rnns-recurring-neural-networks
@@ -10,23 +10,23 @@ dashedName: natural-language-processing-with-rnns-recurring-neural-networks
 
 ## --text--
 
-What is true about Recurrent Neural Networks?
+關於循環神經網絡，哪一項是正確的？
 
 ## --answers--
 
-1: They are a type of feed-forward neural network.
+1：它們是一種前饋神經網絡。
 
 ---
 
-2: They maintain an internal memory/state of the input that was already processed.
+2：它們保持着一個已經處理過的輸入的內部存儲器/狀態。
 
 ---
 
-3: RNN's contain a loop and process one piece of input at a time.
+3：RNN 包含一個循環，每次處理一個輸入。
 
 ---
 
-4: Both 2 and 3.
+4：2 和 3。
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md
index 60118b25c8..8af1d88be6 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d9e
-title: 'Natural Language Processing With RNNs: Sentiment Analysis'
+title: '使用 RNN 進行自然語言處理：情感分析'
 challengeType: 11
 videoId: lYeLtu8Nq7c
 dashedName: natural-language-processing-with-rnns-sentiment-analysis
@@ -10,7 +10,7 @@ dashedName: natural-language-processing-with-rnns-sentiment-analysis
 
 ## --text--
 
-Fill in the blanks below to create the model for the RNN:
+填寫下面的空白來創建 RNN 模型：
 
 ```py
 model = __A__.keras.Sequential([
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
index 2ae0cab5b7..a33ff83255 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72da2
-title: 'Natural Language Processing With RNNs: Training the Model'
+title: '使用 RNN 進行自然語言處理：訓練模型'
 challengeType: 11
 videoId: hEUiK7j9UI8
 dashedName: natural-language-processing-with-rnns-training-the-model
@@ -10,7 +10,7 @@ dashedName: natural-language-processing-with-rnns-training-the-model
 
 ## --text--
 
-Fill in the blanks below to save your model's checkpoints in the `./checkpoints` directory and call the latest checkpoint for training:
+填寫下面的空白以將你模型的檢查點保存在 `./checkpoints` 目錄中，並調用最新的檢查點進行訓練：
 
 ```py
 checkpoint_dir = __A__
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
index f4bde45483..7efcae7efc 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d9b
-title: Natural Language Processing With RNNs
+title: 使用 RNN 的自然語言處理
 challengeType: 11
 videoId: ZyCaF5S-lKg
 dashedName: natural-language-processing-with-rnns
@@ -10,19 +10,19 @@ dashedName: natural-language-processing-with-rnns
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
index 635e29a35d..a0ecbd9c54 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d93
-title: 'Neural Networks: Activation Functions'
+title: '神經網絡：激活函數'
 challengeType: 11
 videoId: S45tqW6BqRs
 dashedName: neural-networks-activation-functions
@@ -10,15 +10,15 @@ dashedName: neural-networks-activation-functions
 
 ## --text--
 
-Which activation function switches values between -1 and 1?
+哪個激活函數在 -1 和 1 之間切換值？
 
 ## --answers--
 
-ReLU (Rectified Linear Unit)
+ReLU（線性整流函數）
 
 ---
 
-Tanh (Hyperbolic Tangent)
+Tanh（雙曲函數）
 
 ---
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
index 05b3df57e0..e42d819345 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d95
-title: 'Neural Networks: Creating a Model'
+title: '神經網絡：創建模型'
 challengeType: 11
 videoId: K8bz1bmOCTw
 dashedName: neural-networks-creating-a-model
@@ -10,7 +10,7 @@ dashedName: neural-networks-creating-a-model
 
 ## --text--
 
-Fill in the blanks below to build a sequential model of dense layers:
+填寫下面的空白，建立一個密集層的順序模型。
 
 ```py
 model = __A__.__B__([
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
index 216b851ab5..32eef4f4f2 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d94
-title: 'Neural Networks: Optimizers'
+title: '神經網絡：優化'
 challengeType: 11
 videoId: hdOtRPQe1o4
 dashedName: neural-networks-optimizers
@@ -10,19 +10,19 @@ dashedName: neural-networks-optimizers
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
index d9d07b00fc..34d5a2a732 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d92
-title: Neural Networks with TensorFlow
+title: 使用 TensorFlow 的神經網絡
 challengeType: 11
 videoId: uisdfrNrZW4
 dashedName: neural-networks-with-tensorflow
@@ -10,19 +10,19 @@ dashedName: neural-networks-with-tensorflow
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
index 1b9f6923a9..3c23f4ff7c 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72da5
-title: 'Reinforcement Learning With Q-Learning: Example'
+title: '使用 Q-Learning 進行強化學習：示例'
 challengeType: 11
 videoId: RBBSNta234s
 dashedName: reinforcement-learning-with-q-learning-example
@@ -10,7 +10,7 @@ dashedName: reinforcement-learning-with-q-learning-example
 
 ## --text--
 
-Fill in the blanks to complete the following Q-Learning equation:
+填空以完成以下 Q-Learning 方程：
 
 ```py
 Q[__A__, __B__] = Q[__A__, __B__] + LEARNING_RATE * (reward + GAMMA * np.max(Q[__C__, :]) - Q[__A__, __B__])
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
index 089f144038..d7c79d65c5 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72da4
-title: 'Reinforcement Learning With Q-Learning: Part 2'
+title: '使用 Q-Learning 進行強化學習：第 2 部分'
 challengeType: 11
 videoId: DX7hJuaUZ7o
 dashedName: reinforcement-learning-with-q-learning-part-2
@@ -10,15 +10,15 @@ dashedName: reinforcement-learning-with-q-learning-part-2
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md
index 3cbeedcfb3..60a6bef315 100644
--- a/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md
+++ b/curriculum/challenges/chinese-traditional/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md
@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72da3
-title: Reinforcement Learning With Q-Learning
+title: 使用 Q-Learning 進行強化學習
 challengeType: 11
 videoId: Cf7DSU0gVb4
 dashedName: reinforcement-learning-with-q-learning
@@ -10,19 +10,19 @@ dashedName: reinforcement-learning-with-q-learning
 
 ## --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--
 
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/apis-and-microservices-certificate/apis-and-microservices-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/apis-and-microservices-certificate/apis-and-microservices-certificate.yml
index b691e98afa..27bfd808b6 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/apis-and-microservices-certificate/apis-and-microservices-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/apis-and-microservices-certificate/apis-and-microservices-certificate.yml
@@ -1,21 +1,21 @@
 ---
 id: 561add10cb82ac38a17523bc
-title: APIs and Microservices Certificate
+title: API 和微服務證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: bd7158d8c443edefaeb5bdef
-    title: Timestamp Microservice
+    title: 時間戳微服務
   - 
     id: bd7158d8c443edefaeb5bdff
-    title: Request Header Parser Microservice
+    title: 請求頭解析器微服務
   - 
     id: bd7158d8c443edefaeb5bd0e
-    title: URL Shortener Microservice
+    title: 短網址微服務
   - 
     id: 5a8b073d06fa14fcfde687aa
-    title: Exercise Tracker
+    title: 運動追蹤器
   - 
     id: bd7158d8c443edefaeb5bd0f
-    title: File Metadata Microservice
+    title: 文件元數據微服務
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/data-analysis-with-python-certificate/data-analysis-with-python-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/data-analysis-with-python-certificate/data-analysis-with-python-certificate.yml
index 238899200c..be995fe120 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/data-analysis-with-python-certificate/data-analysis-with-python-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/data-analysis-with-python-certificate/data-analysis-with-python-certificate.yml
@@ -1,22 +1,22 @@
 ---
 id: 5e46fc95ac417301a38fb934
-title: Data Analysis with Python Certificate
+title: Python 與數據分析證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: 5e46f7e5ac417301a38fb928
-    title: Mean-Variance-Standard Deviation Calculator
+    title: 均值-方差-標準差計算器
   - 
     id: 5e46f7e5ac417301a38fb929
-    title: Demographic Data Analyzer
+    title: 人口統計數據分析器
   - 
     id: 5e46f7f8ac417301a38fb92a
-    title: Medical Data Visualizer
+    title: 醫療數據可視化工具
   - 
     id: 5e46f802ac417301a38fb92b
-    title: Page View Time Series Visualizer
+    title: 頁面訪問量的時間序列可視化工具
   - 
     id: 5e4f5c4b570f7e3a4949899f
-    title: Sea Level Predictor
+    title: 海平面預測器
 
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/data-visualization-certificate/data-visualization-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/data-visualization-certificate/data-visualization-certificate.yml
index 589eebe67f..7e2d4caab2 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/data-visualization-certificate/data-visualization-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/data-visualization-certificate/data-visualization-certificate.yml
@@ -1,21 +1,21 @@
 ---
 id: 5a553ca864b52e1d8bceea14
-title: Data Visualization Certificate
+title: 數據可視化證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: bd7168d8c242eddfaeb5bd13
-    title: Visualize Data with a Bar Chart
+    title: 用條形圖可視化數據
   - 
     id: bd7178d8c242eddfaeb5bd13
-    title: Visualize Data with a Scatterplot Graph
+    title: 用散點圖可視化數據
   - 
     id: bd7188d8c242eddfaeb5bd13
-    title: Visualize Data with a Heat Map
+    title: 用熱圖可視化數據
   - 
     id: 587d7fa6367417b2b2512bbf
-    title: Visualize Data with a Choropleth Map
+    title: 用等值區域圖可視化數據
   - 
     id: 587d7fa6367417b2b2512bc0
-    title: Visualize Data with a Treemap Diagram
+    title: 用樹形圖可視化數據
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/front-end-libraries-certificate/front-end-libraries-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/front-end-libraries-certificate/front-end-libraries-certificate.yml
index 1f0a8f2689..f667aa239f 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/front-end-libraries-certificate/front-end-libraries-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/front-end-libraries-certificate/front-end-libraries-certificate.yml
@@ -1,21 +1,21 @@
 ---
 id: 561acd10cb82ac38a17513bc
-title: Front End Libraries Certificate
+title: 前端庫證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: bd7158d8c442eddfaeb5bd13
-    title: Build a Random Quote Machine
+    title: 創建一個隨機引語生成器
   - 
     id: bd7157d8c242eddfaeb5bd13
-    title: Build a Markdown Previewer
+    title: 創建一個 Markdown 文件預覽器
   - 
     id: 587d7dbc367417b2b2512bae
-    title: Build a Drum Machine
+    title: 創建一臺鼓式機器
   - 
     id: bd7158d8c442eddfaeb5bd17
-    title: Build a JavaScript Calculator
+    title: 創建一個 JavaScript 計算器
   - 
     id: bd7158d8c442eddfaeb5bd0f
-    title: Build a 25 + 5 Clock
+    title: 創建一個番茄時鐘
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/information-security-certificate/information-security-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/information-security-certificate/information-security-certificate.yml
index a6339cfb86..9c66ccf74b 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/information-security-certificate/information-security-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/information-security-certificate/information-security-certificate.yml
@@ -1,21 +1,21 @@
 ---
 id: 5e6021435ac9d0ecd8b94b00
-title: Information Security Certificate
+title: 信息安全證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: 587d824a367417b2b2512c44
-    title: Stock Price Checker
+    title: 股票價格檢查器
   - 
     id: 587d824a367417b2b2512c45
-    title: Anonymous Message Board
+    title: 匿名留言板
   - 
     id: 5e46f979ac417301a38fb932
-    title: Port Scanner
+    title: 端口掃描器
   - 
     id: 5e46f983ac417301a38fb933
-    title: SHA-1 Password Cracker
+    title: SHA-1 密碼破解器
   - 
     id: 5e601c775ac9d0ecd8b94aff
-    title: Secure Real Time Multiplayer Game
+    title: 安全的實時多人遊戲
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/javascript-algorithms-and-data-structures-certificate/javascript-algorithms-and-data-structures-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/javascript-algorithms-and-data-structures-certificate/javascript-algorithms-and-data-structures-certificate.yml
index aebebf678c..26af31e176 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/javascript-algorithms-and-data-structures-certificate/javascript-algorithms-and-data-structures-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/javascript-algorithms-and-data-structures-certificate/javascript-algorithms-and-data-structures-certificate.yml
@@ -1,21 +1,21 @@
 ---
 id: 561abd10cb81ac38a17513bc
-title: JavaScript Algorithms and Data Structures Certificate
+title: JavaScript 算法和數據結構證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: aaa48de84e1ecc7c742e1124
-    title: Palindrome Checker
+    title: 迴文檢查器
   - 
     id: a7f4d8f2483413a6ce226cac
-    title: Roman Numeral Converter
+    title: 羅馬數字轉換器
   - 
     id: 56533eb9ac21ba0edf2244e2
-    title: Caesars Cipher
+    title: 凱撒密碼
   - 
     id: aff0395860f5d3034dc0bfc9
-    title: Telephone Number Validator
+    title: 電話號碼驗證器
   - 
     id: aa2e6f85cab2ab736c9a9b24
-    title: Cash Register
+    title: 計算找零
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/legacy-back-end-certificate/legacy-back-end-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/legacy-back-end-certificate/legacy-back-end-certificate.yml
index d48ecd7921..2073e30f4a 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/legacy-back-end-certificate/legacy-back-end-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/legacy-back-end-certificate/legacy-back-end-certificate.yml
@@ -1,36 +1,36 @@
 ---
 id: 660add10cb82ac38a17513be
-title: Legacy Back End Certificate
+title: 舊版後端證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: bd7158d8c443edefaeb5bdef
-    title: Timestamp Microservice
+    title: 時間戳微服務
   - 
     id: bd7158d8c443edefaeb5bdff
-    title: Request Header Parser Microservice
+    title: 請求頭解析器微服務
   - 
     id: bd7158d8c443edefaeb5bd0e
-    title: URL Shortener Microservice
+    title: 短網址微服務
   - 
     id: bd7158d8c443edefaeb5bdee
-    title: Image Search Abstraction Layer
+    title: 圖像搜索抽象層
   - 
     id: bd7158d8c443edefaeb5bd0f
-    title: File Metadata Microservice
+    title: 文件元數據微服務
   - 
     id: bd7158d8c443eddfaeb5bdef
-    title: Build a Voting App
+    title: 編寫一個投票程序
   - 
     id: bd7158d8c443eddfaeb5bdff
-    title: Build a Nightlife Coordination App
+    title: 建立一個夜生活協調程序
   - 
     id: bd7158d8c443eddfaeb5bd0e
-    title: Chart the Stock Market
+    title: 繪製股市圖
   - 
     id: bd7158d8c443eddfaeb5bd0f
-    title: Manage a Book Trading Club
+    title: 管理一個圖書交易俱樂部
   - 
     id: bd7158d8c443eddfaeb5bdee
-    title: Build a Pinterest Clone
+    title: 建立一個 Pinterest 克隆
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/legacy-data-visualization-certificate/legacy-data-visualization-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/legacy-data-visualization-certificate/legacy-data-visualization-certificate.yml
index 1508cf30d8..550dbdee99 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/legacy-data-visualization-certificate/legacy-data-visualization-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/legacy-data-visualization-certificate/legacy-data-visualization-certificate.yml
@@ -1,36 +1,36 @@
 ---
 id: 561add10cb82ac39a17513bc
-title: Legacy Data Visualization Certificate
+title: 舊版數據可視化證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: bd7157d8c242eddfaeb5bd13
-    title: Build a Markdown Previewer
+    title: 創建一個 Markdown 文件預覽器
   - 
     id: bd7156d8c242eddfaeb5bd13
-    title: Build a Camper Leaderboard
+    title: 建立一個 Camper 排行榜
   - 
     id: bd7155d8c242eddfaeb5bd13
-    title: Build a Recipe Box
+    title: 建立一個食譜盒
   - 
     id: bd7154d8c242eddfaeb5bd13
-    title: Build the Game of Life
+    title: 構建生命遊戲
   - 
     id: bd7153d8c242eddfaeb5bd13
-    title: Build a Roguelike Dungeon Crawler Game
+    title: 創建 Roguelike Dungeon Crawler 遊戲
   - 
     id: bd7168d8c242eddfaeb5bd13
-    title: Visualize Data with a Bar Chart
+    title: 用條形圖可視化數據
   - 
     id: bd7178d8c242eddfaeb5bd13
-    title: Visualize Data with a Scatterplot Graph
+    title: 用散點圖可視化數據
   - 
     id: bd7188d8c242eddfaeb5bd13
-    title: Visualize Data with a Heat Map
+    title: 用熱圖可視化數據
   - 
     id: bd7198d8c242eddfaeb5bd13
-    title: Show National Contiguity with a Force Directed Graph
+    title: 用力導向圖顯示國家接壤
   - 
     id: bd7108d8c242eddfaeb5bd13
-    title: Map Data Across the Globe
+    title: 全球地圖數據
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/legacy-front-end-certificate/legacy-front-end-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/legacy-front-end-certificate/legacy-front-end-certificate.yml
index 93d72c9b7f..a941d64765 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/legacy-front-end-certificate/legacy-front-end-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/legacy-front-end-certificate/legacy-front-end-certificate.yml
@@ -1,36 +1,36 @@
 ---
 id: 561add10cb82ac38a17513be
-title: Legacy Front End Certificate
+title: 舊版前端證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: bd7158d8c242eddfaeb5bd13
-    title: Build a Personal Portfolio Webpage
+    title: 創建一個個人作品集頁面
   - 
     id: bd7158d8c442eddfaeb5bd13
-    title: Build a Random Quote Machine
+    title: 創建一個隨機引語生成器
   - 
     id: bd7158d8c442eddfaeb5bd0f
-    title: Build a 25 + 5 Clock
+    title: 創建一個番茄時鐘
   - 
     id: bd7158d8c442eddfaeb5bd17
-    title: Build a JavaScript Calculator
+    title: 創建一個 JavaScript 計算器
   - 
     id: bd7158d8c442eddfaeb5bd10
-    title: Show the Local Weather
+    title: 顯示當地天氣
   - 
     id: bd7158d8c442eddfaeb5bd1f
-    title: Use the Twitch JSON API
+    title: 使用 Twitch JSON API
   - 
     id: bd7158d8c442eddfaeb5bd18
-    title: Stylize Stories on Camper News
+    title: 風格化學員故事
   - 
     id: bd7158d8c442eddfaeb5bd19
-    title: Build a Wikipedia Viewer
+    title: 創建一個維基百科查看器
   - 
     id: bd7158d8c442eedfaeb5bd1c
-    title: Build a Tic Tac Toe Game
+    title: 建立一個 Tic Tac Toe 遊戲
   - 
     id: bd7158d8c442eddfaeb5bd1c
-    title: Build a Simon Game
+    title: 創建一個西蒙遊戲
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/legacy-full-stack-certificate/legacy-full-stack-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/legacy-full-stack-certificate/legacy-full-stack-certificate.yml
index 97e2fcfc9d..1fcd394593 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/legacy-full-stack-certificate/legacy-full-stack-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/legacy-full-stack-certificate/legacy-full-stack-certificate.yml
@@ -1,24 +1,24 @@
 ---
 id: 561add10cb82ac38a17213bd
-title: Legacy Full Stack Certificate
+title: 舊版全棧證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: 561add10cb82ac38a17513bc
-    title: Responsive Web Design Certificate
+    title: 響應式網頁設計證書
   - 
     id: 561abd10cb81ac38a17513bc
-    title: JavaScript Algorithms and Data Structures Certificate
+    title: JavaScript 算法和數據結構證書
   - 
     id: 561acd10cb82ac38a17513bc
-    title: Front End Libraries Certificate
+    title: 前端庫證書
   - 
     id: 5a553ca864b52e1d8bceea14
-    title: Data Visualization Certificate
+    title: 數據可視化證書
   - 
     id: 561add10cb82ac38a17523bc
-    title: API's and Microservices Certificate
+    title: API 和微服務證書
   - 
     id: 561add10cb82ac38a17213bc
-    title: Legacy Information Security and Quality Assurance Certificate
+    title: 舊版信息安全和質量保證證書
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/legacy-information-security-and-quality-assurance-certificate/legacy-information-security-and-quality-assurance-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/legacy-information-security-and-quality-assurance-certificate/legacy-information-security-and-quality-assurance-certificate.yml
index 1990a343ed..94be7d2467 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/legacy-information-security-and-quality-assurance-certificate/legacy-information-security-and-quality-assurance-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/legacy-information-security-and-quality-assurance-certificate/legacy-information-security-and-quality-assurance-certificate.yml
@@ -1,21 +1,21 @@
 ---
 id: 561add10cb82ac38a17213bc
-title: Legacy Information Security and Quality Assurance Certificate
+title: 舊版信息安全和質量保證證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: 587d8249367417b2b2512c41
-    title: Metric-Imperial Converter
+    title: 公英制轉換器
   - 
     id: 587d8249367417b2b2512c42
-    title: Issue Tracker
+    title: 問題追蹤器
   - 
     id: 587d824a367417b2b2512c43
-    title: Personal Library
+    title: 個人圖書館
   - 
     id: 587d824a367417b2b2512c44
-    title: Stock Price Checker
+    title: 股票價格檢查器
   - 
     id: 587d824a367417b2b2512c45
-    title: Anonymous Message Board
+    title: 匿名留言板
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/machine-learning-with-python-certificate/machine-learning-with-python-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/machine-learning-with-python-certificate/machine-learning-with-python-certificate.yml
index 266eb63948..72369b3848 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/machine-learning-with-python-certificate/machine-learning-with-python-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/machine-learning-with-python-certificate/machine-learning-with-python-certificate.yml
@@ -1,22 +1,22 @@
 ---
 id: 5e46fc95ac417301a38fb935
-title: Machine Learning with Python Certificate
+title: Python 與機器學習證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: 5e46f8d6ac417301a38fb92d
-    title: Rock Paper Scissors
+    title: 剪刀石頭布
   - 
     id: 5e46f8dcac417301a38fb92e
-    title: Cat and Dog Image Classifier
+    title: 貓和狗圖像分類器
   - 
     id: 5e46f8e3ac417301a38fb92f
-    title: Book Recommendation Engine using KNN
+    title: 基於 KNN 的圖書推薦引擎
   - 
     id: 5e46f8edac417301a38fb930
-    title: Linear Regression Health Costs Calculator
+    title: 線性迴歸健康成本計算器
   - 
     id: 5e46f8edac417301a38fb931
-    title: Neural Network SMS Text Classifier
+    title: 神經網絡短信分類器
 
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/quality-assurance-certificate/quality-assurance-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/quality-assurance-certificate/quality-assurance-certificate.yml
index 5e229ba55c..c53c34faef 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/quality-assurance-certificate/quality-assurance-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/quality-assurance-certificate/quality-assurance-certificate.yml
@@ -1,22 +1,22 @@
 ---
 id: 5e611829481575a52dc59c0e
-title: Quality Assurance Certificate
+title: 質量保證證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: 587d8249367417b2b2512c41
-    title: Metric-Imperial Converter
+    title: 公制 - 英制轉換器
   - 
     id: 587d8249367417b2b2512c42
-    title: Issue Tracker
+    title: 問題跟蹤器
   - 
     id: 587d824a367417b2b2512c43
-    title: Personal Library
+    title: 個人圖書館
   - 
     id: 5e601bf95ac9d0ecd8b94afd
-    title: Sudoku Solver
+    title: 數獨求解器
   - 
     id: 5e601c0d5ac9d0ecd8b94afe
-    title: American British Translator
+    title: 美式英語與英式英語轉換器
 
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/relational-databases-certificate/relational-databases-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/relational-databases-certificate/relational-databases-certificate.yml
new file mode 100644
index 0000000000..74a2bfaefc
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/12-certificates/relational-databases-certificate/relational-databases-certificate.yml
@@ -0,0 +1,21 @@
+---
+id: 606243f50267e718b1e755f4
+title: 關係型數據庫證書
+challengeType: 7
+isPrivate: true
+tests:
+  - 
+    id: 5f1a4ef5d5d6b5ab580fc6ae
+    title: 天體數據庫
+  - 
+    id: 5f9771307d4d22b9d2b75a94
+    title: 世界盃數據庫
+  - 
+    id: 5f87ac112ae598023a42df1a
+    title: 沙龍預約計劃
+  - 
+    id: 602d9ff222201c65d2a019f2
+    title: 元素週期表數據庫
+  - 
+    id: 602da04c22201c65d2a019f4
+    title: 終極挑戰
diff --git a/curriculum/challenges/chinese-traditional/12-certificates/scientific-computing-with-python-certificate/scientific-computing-with-python-certificate.yml b/curriculum/challenges/chinese-traditional/12-certificates/scientific-computing-with-python-certificate/scientific-computing-with-python-certificate.yml
index 1f2f103e94..29ffd2867d 100644
--- a/curriculum/challenges/chinese-traditional/12-certificates/scientific-computing-with-python-certificate/scientific-computing-with-python-certificate.yml
+++ b/curriculum/challenges/chinese-traditional/12-certificates/scientific-computing-with-python-certificate/scientific-computing-with-python-certificate.yml
@@ -1,21 +1,21 @@
 ---
 id: 5e44431b903586ffb414c951
-title: Scientific Computing with Python Certificate
+title: Python 與科學計算證書
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: 5e44412c903586ffb414c94c
-    title: Arithmetic Formatter
+    title: 算數格式化
   - 
     id: 5e444136903586ffb414c94d
-    title: Time Calculator
+    title: 時間計算器
   - 
     id: 5e44413e903586ffb414c94e
-    title: Budget App
+    title: 預算應用
   - 
     id: 5e444147903586ffb414c94f
-    title: Polygon Area Calculator
+    title: 多邊形面積計算器
   - 
     id: 5e44414f903586ffb414c950
-    title: Probability Calculator
+    title: 概率計算器
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/celestial-bodies-database.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/celestial-bodies-database.md
new file mode 100644
index 0000000000..3dd7c343d3
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/celestial-bodies-database.md
@@ -0,0 +1,18 @@
+---
+id: 5f1a4ef5d5d6b5ab580fc6ae
+title: Celestial Bodies Database
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.celestial-bodies-database
+dashedName: celestial-bodies-database
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/final-boss.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/final-boss.md
new file mode 100644
index 0000000000..2ba55685f4
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/final-boss.md
@@ -0,0 +1,18 @@
+---
+id: 602da04c22201c65d2a019f4
+title: Final Boss
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.final-boss
+dashedName: final-boss
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-advanced-bash-by-building.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-advanced-bash-by-building.md
new file mode 100644
index 0000000000..9fd49d4f15
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-advanced-bash-by-building.md
@@ -0,0 +1,18 @@
+---
+id: 602da0de22201c65d2a019f6
+title: Learn Advanced Bash by Building
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.learn-advanced-bash-by-building
+dashedName: learn-advanced-bash-by-building
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-and-sql-by-building-a-bike-rental-shop.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-and-sql-by-building-a-bike-rental-shop.md
new file mode 100644
index 0000000000..76f6ff4eea
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-and-sql-by-building-a-bike-rental-shop.md
@@ -0,0 +1,17 @@
+---
+id: 5f5b969a05380d2179fe6e18
+title: Learn Bash and SQL by Building a Bike Rental Shop
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.learn-bash-and-sql-by-building-a-bike-rental-shop
+dashedName: learn-bash-and-sql-by-building-a-bike-rental-shop
+---
+
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-by-building-a-boilerplate.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-by-building-a-boilerplate.md
new file mode 100644
index 0000000000..e1d2873609
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-by-building-a-boilerplate.md
@@ -0,0 +1,18 @@
+---
+id: 5ea8adfab628f68d805bfc5e
+title: Learn Bash by Building a Boilerplate
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/freeCodeCamp/.learn-bash-by-building-a-boilerplate
+dashedName: learn-bash-by-building-a-boilerplate
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-scripting-by-building-five-programs.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-scripting-by-building-five-programs.md
new file mode 100644
index 0000000000..af55d50738
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-bash-scripting-by-building-five-programs.md
@@ -0,0 +1,18 @@
+---
+id: 5f5904ac738bc2fa9efecf5a
+title: Learn Bash Scripting by Building Five Programs
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.learn-bash-scripting-by-building-five-programs
+dashedName: learn-bash-scripting-by-building-five-programs
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-git-by-building-an-sql-reference-object.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-git-by-building-an-sql-reference-object.md
new file mode 100644
index 0000000000..c2b735a923
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-git-by-building-an-sql-reference-object.md
@@ -0,0 +1,18 @@
+---
+id: 5fa323cdaf6a73463d590659
+title: Learn Git by Building an SQL Reference Object
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.learn-git-by-building-an-sql-reference-object
+dashedName: learn-git-by-building-an-sql-reference-object
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-github-by-building-a-list-of-inspirational-quotes.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-github-by-building-a-list-of-inspirational-quotes.md
new file mode 100644
index 0000000000..f98a0b9293
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-github-by-building-a-list-of-inspirational-quotes.md
@@ -0,0 +1,18 @@
+---
+id: 602da04222201c65d2a019f3
+title: Learn GitHub by Building a List of Inspirational Quotes
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.learn-github-by-building-a-list-of-inspirational-quotes
+dashedName: learn-github-by-building-a-list-of-inspirational-quotes
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-nano-by-building-a-castle.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-nano-by-building-a-castle.md
new file mode 100644
index 0000000000..b6f9e4ad71
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-nano-by-building-a-castle.md
@@ -0,0 +1,18 @@
+---
+id: 5f32db63eb37f7e17323f459
+title: Learn Nano by Building a Castle
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.learn-nano-by-building-a-castle
+dashedName: learn-nano-by-building-a-castle
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-relational-databases-by-building-a-mario-database.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-relational-databases-by-building-a-mario-database.md
new file mode 100644
index 0000000000..189dcc68b7
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-relational-databases-by-building-a-mario-database.md
@@ -0,0 +1,18 @@
+---
+id: 5f2c289f164c29556da632fd
+title: Learn Relational Databases by Building a Mario Database
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.learn-relational-databases-by-building-a-mario-database
+dashedName: learn-relational-databases-by-building-a-mario-database
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-sql-by-building-a-student-database.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-sql-by-building-a-student-database.md
new file mode 100644
index 0000000000..7b95cbca4b
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/learn-sql-by-building-a-student-database.md
@@ -0,0 +1,18 @@
+---
+id: 602da0c222201c65d2a019f5
+title: Learn SQL by Building a Student Database
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.learn-sql-by-building-a-student-database
+dashedName: learn-sql-by-building-a-student-database
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/periodic-table-database.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/periodic-table-database.md
new file mode 100644
index 0000000000..05c18517d1
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/periodic-table-database.md
@@ -0,0 +1,18 @@
+---
+id: 602d9ff222201c65d2a019f2
+title: Periodic Table Database
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.periodic-table-database
+dashedName: periodic-table-database
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/salon-appointment-scheduler.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/salon-appointment-scheduler.md
new file mode 100644
index 0000000000..26fdda731e
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/salon-appointment-scheduler.md
@@ -0,0 +1,18 @@
+---
+id: 5f87ac112ae598023a42df1a
+title: Salon Appointment Scheduler
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.salon-appointment-scheduler
+dashedName: salon-appointment-scheduler
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
diff --git a/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/world-cup-database.md b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/world-cup-database.md
new file mode 100644
index 0000000000..196a965de7
--- /dev/null
+++ b/curriculum/challenges/chinese-traditional/13-relational-databases/learn-relational-databases/world-cup-database.md
@@ -0,0 +1,18 @@
+---
+id: 5f9771307d4d22b9d2b75a94
+title: World Cup Database
+challengeType: 12
+helpCategory: Relational Databases
+url: https://github.com/moT01/.world-cup-database
+dashedName: world-cup-database
+---
+
+# --description--
+
+# --instructions--
+
+# --hints--
+
+# --seed--
+
+# --solutions--
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
index 926ab4a96b..888aef2c94 100644
--- 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
@@ -14,7 +14,7 @@ L'ultima sfida ha mostrato che React può controllare lo stato interno di alcuni
 
 Il componente `MyForm` è impostato con un `form` vuoto con un gestore di invio. Il gestore di invio verrà chiamato al momento dell'invio del modulo.
 
-Abbiamo aggiunto un bottone che invia il modulo. Puoi vedere che il `type` è impostato su `submit` indicando che è il bottone che controlla il modulo. Aggiungi l'elemento `input` nel `form` e imposta i suoi attributi `value` e `onChange()` come nell'ultima sfida. Dovresti quindi completare il metodo `handleSubmit` in modo che imposti la proprietà di stato del componente `submit` al valore corrente dell'input nello `state` locale.
+Abbiamo aggiunto un bottone che invia il modulo. Puoi vedere che il `type` è impostato su `submit` indicando che è il bottone che controlla il modulo. Aggiungi l'elemento `input` nel `form` e imposta i suoi attributi `value` e `onChange()` come nell'ultima sfida. Dovresti quindi completare il metodo `handleSubmit` in modo che imposti la proprietà di stato `submit` del componente al valore corrente di input nello `state` locale.
 
 **Nota:** Devi anche chiamare `event.preventDefault()` nel gestore di invio, per evitare il comportamento predefinito di invio del modulo che ricaricherà la pagina web. Per comodità, il comportamento predefinito è stato disabilitato qui per evitare che gli aggiornamenti reimpostino il codice della sfida.
 
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
index 19a5a3bd9f..b553a25d2a 100644
--- 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
@@ -10,7 +10,7 @@ dashedName: introducing-inline-styles
 
 Ci sono altri concetti complessi che aggiungono potenti funzionalità al tuo codice React. Ma forse ti stai chiedendo come stilizzare quegli elementi JSX che crei in React. Probabilmente sai che non sarà esattamente come lavorare con HTML a causa del [modo in cui applichi le classi agli elementi JSX](/learn/front-end-libraries/react/define-an-html-class-in-jsx).
 
-Se importi degli stili da un foglio di stile, non poi è così diverso. Applichi una classe al tuo elemento JSX usando l'attributo `className` e applichi gli stili alla classe nel tuo foglio di stile. Un'altra opzione è quella di applicare degli stili in linea, che sono molto comuni nello sviluppo di ReactJS.
+Se importi degli stili da un foglio di stile, non è poi così diverso. Applichi una classe al tuo elemento JSX usando l'attributo `className` e applichi gli stili alla classe nel tuo foglio di stile. Un'altra opzione è quella di applicare degli stili in linea, che sono molto comuni nello sviluppo di ReactJS.
 
 Puoi applicare degli stili in linea a elementi JSX in modo simile a come faresti in HTML, ma con alcune differenze JSX. Ecco un esempio di uno stile in linea in HTML:
 
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
index c51eb0a7c8..6231c4d771 100644
--- 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
@@ -12,7 +12,7 @@ Puoi passare lo `state` come proprietà ai componenti figli, ma non sei limitato
 
 # --instructions--
 
-Ci sono tre componenti delineati nell'editor di codice. Il componente `MyApp` è il genitore che presenterà i componenti figli `GetInput` e `RenderInput`. Aggiungi il componente `GetInput` al metodo render in `MyApp`, poi passagli una proprietà chiamata `input` assegnata a `inputValue` dallo `state` di `MyApp`. Crea anche una proprietà chiamata `handleChange` e passale il gestore di input `handleChange`.
+Ci sono tre componenti delineati nell'editor di codice. Il componente `MyApp` è il genitore che presenterà i componenti figli `GetInput` e `RenderInput`. Aggiungi il componente `GetInput` al metodo render in `MyApp`, poi passagli una proprietà chiamata `input` con valore di `inputValue` dallo `state` di `MyApp`. Crea anche una proprietà chiamata `handleChange` e passale il gestore di input `handleChange`.
 
 Successivamente, aggiungi `RenderInput` al metodo render in `MyApp`, quindi crea una proprietà chiamata `input` e passale l'`inputValue` dallo `state`. Una volta terminato, potrai digitare nel campo `input` nel componente `GetInput`, che poi chiamerà il metodo di gestione nel suo genitore tramite le props. Questo aggiorna l'input nello `state` del genitore, che viene passato come proprietà ad entrambi i figli. Osserva come i dati scorrono tra i componenti e come l'unica fonte di verità rimane lo `state` del componente genitore. Certamente questo esempio è un po' limitato, ma dovrebbe bastare a illustrare come i dati e le callback possono essere passati tra i componenti di React.
 
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
index 3d62a72414..f23ecdd208 100644
--- 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
@@ -12,7 +12,7 @@ C'è un altro modo per accedere allo `state` in un componente. Nel metodo `rende
 
 # --instructions--
 
-Nel metodo di rendering `MyComponent`, definisci una `const` chiamata `name` e impostala al valore di name nello `state` del componente. Poiché in questa parte del codice è possibile scrivere direttamente in JavaScript, non è necessario racchiudere questo riferimento tra parentesi graffe.
+Nel metodo render di `MyComponent`, definisci una `const` chiamata `name` e impostala al valore di name nello `state` del componente. Poiché in questa parte del codice è possibile scrivere direttamente in JavaScript, non è necessario racchiudere questo riferimento tra parentesi graffe.
 
 Successivamente, nell'istruzione return, presenta questo valore in un tag `h1` utilizzando la variabile `name`. Ricorda però che nell'istruzione return dovrai utilizzare la sintassi JSX (parentesi graffe per il JavaScript).
 
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
index 989f5e97ae..46952f222d 100644
--- 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
@@ -26,15 +26,15 @@ Come puoi vedere, il corpo è codificato come la query string. Questo è il form
 
 # --instructions--
 
-Installa il modulo `body-parser` nel tuo `package.json`. Poi, richiedilo con `require` all'inizio del file. Memorizzalo in una variabile chiamata `bodyParser`. Il middleware per gestire i dati urlencoded viene restituito da `bodyParser.urlencoded({extended: false})`. Pass the function returned by the previous method call to `app.use()`. As usual, the middleware must be mounted before all the routes that depend on it.
+Installa il modulo `body-parser` nel tuo `package.json`. Poi, richiedilo con `require` all'inizio del file. Memorizzalo in una variabile chiamata `bodyParser`. Il middleware per gestire i dati urlencoded viene restituito da `bodyParser.urlencoded({extended: false})`. Passa ad `app.use()` la funzione restituita dal metodo invocato prima. Come al solito, il middleware deve essere montato prima di tutte le rotte che dipendono da esso.
 
-**Note:** `extended` is a configuration option that tells `body-parser` which parsing needs to be used. When `extended=false` it uses the classic encoding `querystring` library. When `extended=true` it uses `qs` library for parsing.
+**Nota:** `extended` è un'opzione di configurazione che dice al `body-parser` quale analisi deve essere utilizzata. Quando `extended=false` viene utilizzata la libreria di codifica classica `querystring`. Quando `extended=true` viene usata per il parsing la libreria `qs`.
 
-When using `extended=false`, values can be only strings or arrays. The object returned when using `querystring` does not prototypically inherit from the default JavaScript `Object`, which means functions like `hasOwnProperty`, `toString` will not be available. The extended version allows more data flexibility, but it is outmatched by JSON.
+Quando si utilizza `extended=false`, i valori possono essere solo stringhe o array. L'oggetto restituito quando si utilizza `querystring` non eredita prototipalmente da `Object`, predefinito in JavaScript, quindi funzioni come `hasOwnProperty` e `toString` non saranno disponibili. La versione estesa consente una maggiore flessibilità dei dati, ma è superata da JSON.
 
 # --hints--
 
-The 'body-parser' middleware should be mounted
+Il middleware 'body-parser' dovrebbe essere montato
 
 ```js
 (getUserInput) =>
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
index 03d737f4aa..cc439710a8 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 5895f70cf9fc0f352b528e67
-title: Implement the Serialization of a Passport User
+title: Implementare la serializzazione di un utente Passport
 challengeType: 2
 forumTopicId: 301556
 dashedName: implement-the-serialization-of-a-passport-user
@@ -8,11 +8,11 @@ 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.
+Per ora non stiamo caricando un oggetto utente reale visto che non abbiamo creato il database. Questo può essere fatto in molti modi diversi, ma per il nostro progetto ci connetteremo al database una volta che avremo avviato il server e ottenuto una connessione persistente per tutto il ciclo di vita dell'app. Per fare questo, aggiungi la stringa di connessione del database (per esempio: `mongodb+srv://:@cluster0-jvwxi.mongodb.net/?retryWrites=true&w=majority`) alla variabile ambientale `MONGO_URI`. Questo è usato nel file `connection.js`.
 
-*You can set up a free database on [MongoDB Atlas](https://www.mongodb.com/cloud/atlas).*
+*Puoi creare un database gratuito su [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:
+Ora vogliamo connetterci al nostro database e metterci in ascolto delle richieste. Lo scopo è di non permettere richieste prima che il database sia connesso o nel caso ci sia un errore del database. Per farlo, dovrai includere la tua serializzazione e le rotte della tua app nel seguente codice:
 
 ```js
 myDB(async client => {
@@ -38,13 +38,13 @@ myDB(async client => {
 // app.listen out here...
 ```
 
-Be sure to uncomment the `myDataBase` code in `deserializeUser`, and edit your `done(null, null)` to include the `doc`.
+Assicurati di decommentare il codice di `myDataBase` in `deserializeUser`, e modifica il tuo `done(null, null)` per includere il `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).
+Invia la tua pagina quando pensi di averlo fatto correttamente. Se dovessi incontrare degli errori, puoi controllare il progetto completato fino a questo punto [qui](https://gist.github.com/camperbot/175f2f585a2d8034044c7e8857d5add7).
 
 # --hints--
 
-Database connection should be present.
+La connessione al database dovrebbe essere presente.
 
 ```js
 (getUserInput) =>
@@ -62,7 +62,7 @@ Database connection should be present.
   );
 ```
 
-Deserialization should now be correctly using the DB and `done(null, null)` should be called with the `doc`.
+La deserializzazione dovrebbe ora usare correttamente il DB e `done(null, null)` dovrebbe essere invocato con il `doc`.
 
 ```js
 (getUserInput) =>
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
index 6e6b65cf56..3fd7f87497 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 589a8eb3f9fc0f352b528e72
-title: Implementation of Social Authentication III
+title: Implementazione dell'autenticazione con i social III
 challengeType: 2
 forumTopicId: 301558
 dashedName: implementation-of-social-authentication-iii
@@ -8,7 +8,7 @@ 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:
+La parte finale della strategia è gestire il profilo restituito da GitHub. Dobbiamo caricare l'oggetto del database relativo all'uutente se esiste, o crearne uno se non esiste, e popolare i campi dal profilo, quindi restituire l'oggetto dell'utente. GitHub ci fornisce un *id* unico per ogni profilo che possiamo usare per cercare e serializzare l'utente (già implementato). Di seguito è riportato un esempio di implementazione che puoi usare nel tuo progetto: va all'interno della funzione che è il secondo argomento per la nuova strategia, proprio sotto all'attuale posizione di `console.log(profile);`:
 
 ```js
 myDataBase.findOneAndUpdate(
@@ -38,15 +38,15 @@ myDataBase.findOneAndUpdate(
 );
 ```
 
-`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.
+`findOneAndUpdate` ti permette di cercare un oggetto e aggiornarlo. Se l'oggetto non esiste, verrà inserito e reso disponibile alla funzione di callback. In questo esempio, abbiamo sempre impostato `last_login`, incrementato il `login_count` di `1`, e popolato la maggior parte dei campi solo quando viene inserito un nuovo oggetto (nuovo utente). Nota l'uso dei valori predefiniti. A volte un profilo restituito non avrà tutte le informazioni compilate o l'utente lo manterrà privato. Dovrai gestire questo caso per evitare un errore.
 
-You should be able to login to your app now--try it!
+Ora dovresti essere in grado di accedere alla tua app, provala!
 
-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).
+Invia la tua pagina quando pensi di averlo fatto correttamente. Se incontri degli errori, puoi controllare il progetto completato fino a questo punto [qui](https://gist.github.com/camperbot/183e968f0e01d81dde015d45ba9d2745).
 
 # --hints--
 
-GitHub strategy setup should be complete.
+La configurazione della strategia GitHub dovrebbe essere completa.
 
 ```js
 (getUserInput) =>
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
index 32b3ab7963..b466efac46 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 5895f70cf9fc0f352b528e66
-title: Serialization of a User Object
+title: Serializzazione di un oggetto utente
 challengeType: 2
 forumTopicId: 301563
 dashedName: serialization-of-a-user-object
@@ -8,11 +8,11 @@ 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.
+La serializzazione e la deserializzazione sono concetti importanti per quanto riguarda l'autenticazione. Serializzare un oggetto significa convertire il suo contenuto in una piccola *chiave* (key) che può essere deserializzata nell'oggetto originale. Questo ci permette di sapere chi ha comunicato con il server senza dover inviare i dati di autenticazione, come il nome utente e la password, ad ogni richiesta di una nuova pagina.
 
-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 )`
+Per configurarlo correttamente, dobbiamo avere una funzione di serializzazione e una funzione di deserializzazione. In Passport, li creiamo con `passport.serializeUser( OURFUNCTION )` e `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:
+`serializeUser` è chiamato con 2 argomenti, l'oggetto utente completo e una callback utilizzata da passport. Una chiave univoca per identificare quell'utente deve essere restituita nella callback, quello più semplice da usare è l'`_id` dell'utente nell'oggetto. Esso dovrebbe essere unico dato che è stato generato da MongoDB. Allo stesso modo, anche `deserializeUser` viene chiamato con quella chiave e una funzione callback per passport, ma questa volta dobbiamo prendere quella chiave e restituire l'intero oggetto utente alla callback. Per creare una query di ricerca per un `_id` Mongo, dovrai creare `const ObjectID = require('mongodb').ObjectID;`, e poi per usarlo invocare `new ObjectID(THE_ID)`. Assicurati di aggiungere `mongodb@~3.6.0` come dipendenza. Puoi vederlo negli esempi qui sotto:
 
 ```js
 passport.serializeUser((user, done) => {
@@ -26,13 +26,13 @@ passport.deserializeUser((id, done) => {
 });
 ```
 
-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`.
+NOTA: Questo `deserializeUser` genererà un errore fino a quando non imposteremo il DB nel passo successivo, quindi per ora commenta l'intero blocco e chiama `done(null, null)` nella funzione `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).
+Invia la tua pagina quando pensi di averlo fatto correttamente. Se incontri degli errori, puoi controllare il progetto completato fino a questo punto [qui](https://gist.github.com/camperbot/7068a0d09e61ec7424572b366751f048).
 
 # --hints--
 
-You should serialize user function correctly.
+Dovresti serializzare correttamente la funzione user.
 
 ```js
 (getUserInput) =>
@@ -55,7 +55,7 @@ You should serialize user function correctly.
   );
 ```
 
-You should deserialize user function correctly.
+Dovresti deserializzare correttamente la funzione user.
 
 ```js
 (getUserInput) =>
@@ -78,7 +78,7 @@ You should deserialize user function correctly.
   );
 ```
 
-MongoDB should be a dependency.
+MongoDB dovrebbe essere una dipendenza.
 
 ```js
 (getUserInput) =>
@@ -97,7 +97,7 @@ MongoDB should be a dependency.
   );
 ```
 
-Mongodb should be properly required including the ObjectId.
+Mongodb dovrebbe essere richiesto correttamente, includendo l'ObjectId.
 
 ```js
 (getUserInput) =>
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
index df609ee419..6a056eff5e 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d824c367417b2b2512c4c
-title: Assert Deep Equality with .deepEqual and .notDeepEqual
+title: Asserire l'uguaglianza profonda con .deepEqual e .notDeepEqual
 challengeType: 2
 forumTopicId: 301587
 dashedName: assert-deep-equality-with--deepequal-and--notdeepequal
@@ -8,17 +8,17 @@ 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/).
+Come promemoria, questo progetto viene costruito a partire dal seguente progetto iniziale su [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), o clonato da [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
 
-`deepEqual()` asserts that two objects are deep equal.
+`deepEqual()` afferma che due oggetti sono uguali in maniera profonda.
 
 # --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.
+All'interno di `tests/1_unit-tests.js`, sotto il test etichettato con `#7`, nella suite `Equality`, cambia ogni asserzione `assert` in `assert.deepEqual` o `assert.notDeepEqual` per far superare il test (dovrebbe risultare `true`). Non alterare gli argomenti passati alle asserzioni.
 
 # --hints--
 
-All tests should pass.
+Tutti i test dovrebbero essere superati.
 
 ```js
 (getUserInput) =>
@@ -32,7 +32,7 @@ All tests should pass.
   );
 ```
 
-You should choose the correct method for the first assertion - `deepEqual` vs. `notDeepEqual`.
+Dovresti scegliere il metodo corretto per la prima asserzione - `deepEqual` oppure `notDeepEqual`.
 
 ```js
 (getUserInput) =>
@@ -50,7 +50,7 @@ You should choose the correct method for the first assertion - `deepEqual` vs. `
   );
 ```
 
-You should choose the correct method for the second assertion - `deepEqual` vs. `notDeepEqual`.
+Dovresti scegliere il metodo corretto per la seconda asserzione - `deepEqual` oppure `notDeepEqual`.
 
 ```js
 (getUserInput) =>
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
index 30f1e51eee..348bc31012 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d824c367417b2b2512c4d
-title: Compare the Properties of Two Elements
+title: Confrontare le proprietà di due elementi
 challengeType: 2
 forumTopicId: 301588
 dashedName: compare-the-properties-of-two-elements
@@ -8,15 +8,15 @@ 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/).
+Come promemoria, questo progetto viene costruito a partire dal seguente progetto iniziale su [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), o clonato da [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.
+All'interno di `tests/1_unit-tests.js`, sotto il test etichettato con `#8`, nella suite `Comparisons`, cambia ogni asserzione `assert` in `assert.isAbove` o `assert.isAtMost` per far superare il test (dovrebbe risultare `true`). Non alterare gli argomenti passati alle asserzioni.
 
 # --hints--
 
-All tests should pass.
+Tutti i test dovrebbero essere superati.
 
 ```js
 (getUserInput) =>
@@ -30,7 +30,7 @@ All tests should pass.
   );
 ```
 
-You should choose the correct method for the first assertion - `isAbove` vs. `isAtMost`.
+Dovresti scegliere il metodo corretto per la prima asserzione - `isAbove` oppure `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -48,7 +48,7 @@ You should choose the correct method for the first assertion - `isAbove` vs. `is
   );
 ```
 
-You should choose the correct method for the second assertion - `isAbove` vs. `isAtMost`.
+Dovresti scegliere il metodo corretto per la seconda asserzione - `isAbove` oppure `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -62,7 +62,7 @@ You should choose the correct method for the second assertion - `isAbove` vs. `i
   );
 ```
 
-You should choose the correct method for the third assertion - `isAbove` vs. `isAtMost`.
+Dovresti scegliere il metodo corretto per la terza asserzione - `isAbove` oppure `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -80,7 +80,7 @@ You should choose the correct method for the third assertion - `isAbove` vs. `is
   );
 ```
 
-You should choose the correct method for the fourth assertion - `isAbove` vs. `isAtMost`.
+Dovresti scegliere il metodo corretto per la quarta asserzione - `isAbove` oppure `isAtMost`.
 
 ```js
 (getUserInput) =>
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
index f9ca69d575..6315992bd3 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d824f367417b2b2512c5a
-title: Run Functional Tests on an API Response using Chai-HTTP III - PUT method
+title: Eseguire test funzionali su una risposta API utilizzando il metodo Chai-HTTP III - PUT
 challengeType: 2
 forumTopicId: 301590
 dashedName: run-functional-tests-on-an-api-response-using-chai-http-iii---put-method
@@ -8,9 +8,9 @@ dashedName: run-functional-tests-on-an-api-response-using-chai-http-iii---put-me
 
 # --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/).
+Come promemoria, questo progetto viene costruito a partire dal seguente progetto iniziale su [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), o clonato da [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:
+Nel prossimo esempio vedremo come inviare i dati in nel corpo di un payload di richiesta. Stiamo per testare una richiesta PUT. L'endpoint `'/travellers'` accetta un oggetto JSON che prende la struttura:
 
 ```json
 {
@@ -18,7 +18,7 @@ In the next example we'll see how to send data in a request payload (body). We a
 }
 ```
 
-The route responds with :
+La rotta risponde con:
 
 ```json
 {
@@ -26,13 +26,13 @@ The route responds with :
 }
 ```
 
-See the server code for more details.
+Vedi il codice del server per maggiori dettagli.
 
 # --instructions--
 
-Within `tests/2_functional-tests.js`, alter the `'send {surname: "Colombo"}'` test (`// #3`):
+All'interno di `tests/2_functional-tests.js`, modifica il test `'send {surname: "Colombo"}'` (`// #3`):
 
-Send the following JSON response as a payload:
+Invia la seguente risposta JSON come payload:
 
 ```json
 {
@@ -40,18 +40,18 @@ Send the following JSON response as a payload:
 }
 ```
 
-Check for the following, within the `request.end` callback:
+Controlla quanto segue, all'interno della callback `request.end`:
 
 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.
+Segui l'ordine di asserzione indicato sopra - facciamo affidamento su di esso. Assicurati di rimuovere `assert.fail()`, una volta finito.
 
 # --hints--
 
-All tests should pass.
+Tutti i test dovrebbero essere superati.
 
 ```js
 (getUserInput) =>
@@ -65,7 +65,7 @@ All tests should pass.
   );
 ```
 
-You should test for 'res.status' to be 200.
+Dovresti verificare che 'res.status' sia 200.
 
 ```js
 (getUserInput) =>
@@ -81,7 +81,7 @@ You should test for 'res.status' to be 200.
   );
 ```
 
-You should test for 'res.type' to be 'application/json'.
+Dovresti verificare che 'res.type' sia 'application/json'.
 
 ```js
 (getUserInput) =>
@@ -97,7 +97,7 @@ You should test for 'res.type' to be 'application/json'.
   );
 ```
 
-You should test for 'res.body.name' to be 'Cristoforo'.
+Dovresti verificare che 'res.body.name' sia 'Cristoforo''.
 
 ```js
 (getUserInput) =>
@@ -113,7 +113,7 @@ You should test for 'res.body.name' to be 'Cristoforo'.
   );
 ```
 
-You should test for 'res.body.surname' to be 'Colombo'.
+Dovresti verificare che 'res.body.surname' sia 'Colombo''.
 
 ```js
 (getUserInput) =>
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
index d34360de18..a3af790a56 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 5f8884f4c46685731aabfc41
-title: Run Functional Tests Using a Headless Browser II
+title: Eseguire test funzionali usando un headless browser II
 challengeType: 2
 forumTopicId: 301594
 dashedName: run-functional-tests-using-a-headless-browser-ii
@@ -8,27 +8,27 @@ 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/).
+Come promemoria, questo progetto viene costruito a partire dal seguente progetto iniziale su [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), o clonato da [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:
+All'interno di `tests/2_functional-tests.js`, nel test `'submit "surname" : "Vespucci" - write your e2e test...'` (`// #6`), automatizza la compilazione e invia il modulo:
 
-1.  Fill in the form with the `surname` of `Vespucci`
-2.  Submit it pressing `'submit'` button
+1.  Compila il modulo con il `surname` di `Vespucci`
+2.  Invia premendo il pulsante `'submit'`
 
-Within the callback:
+All'interno della 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`
+1.  asserisci che lo stato è `200`
+2.  asserisci che il testo all'interno dell'elemento `span#name` è `'Amerigo'`
+3.  asserisci che il testo all'interno dell'elemento `span#surname` è `'Vespucci'`
+4.  asserisci che gli elementi `span#dates` esistono e il loro conteggio è `1`
 
-Do not forget to to remove the `assert.fail()` call.
+Non dimenticare di rimuovere la chiamata `assert.fail()`.
 
 # --hints--
 
-All tests should pass.
+Tutti i test dovrebbero essere superati.
 
 ```js
 (getUserInput) =>
@@ -42,7 +42,7 @@ All tests should pass.
   );
 ```
 
-You should assert that the headless browser request succeeded.
+Dovresti asserire che la richiesta dell'headless browser sia riuscita.
 
 ```js
 (getUserInput) =>
@@ -56,7 +56,7 @@ You should assert that the headless browser request succeeded.
   );
 ```
 
-You should assert that the text inside the element 'span#name' is 'Amerigo'.
+Dovresti asserire che il testo all'interno dell'elemento 'span#name' sia 'Amerigo'.
 
 ```js
 (getUserInput) =>
@@ -72,7 +72,7 @@ You should assert that the text inside the element 'span#name' is 'Amerigo'.
   );
 ```
 
-You should assert that the text inside the element 'span#surname' is 'Vespucci'.
+Dovresti asserire che il testo all'interno dell'elemento 'span#surname' sia 'Vespucci'.
 
 ```js
 (getUserInput) =>
@@ -88,7 +88,7 @@ You should assert that the text inside the element 'span#surname' is 'Vespucci'.
   );
 ```
 
-You should assert that the element 'span#dates' exist and its count is 1.
+Dovresti asserire che l'elemento 'span#dates' esista e il suo conteggio sia 1.
 
 ```js
 (getUserInput) =>
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
index 3ed6428022..8e4fd0cce5 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d824d367417b2b2512c50
-title: Test if a Value is an Array
+title: Verificare se un valore è un array
 challengeType: 2
 forumTopicId: 301600
 dashedName: test-if-a-value-is-an-array
@@ -8,15 +8,15 @@ 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/).
+Come promemoria, questo progetto viene a partire dal seguente progetto iniziale su [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), o clonato da [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.
+All'interno di `tests/1_unit-tests.js`, sotto il test etichettato con `#11`, nella suite `Arrays`, cambia ogni asserzione `assert` in `assert.isArray` o `assert.isNotArray` per far superare il test (dovrebbe risultare `true`). Non alterare gli argomenti passati alle asserzioni.
 
 # --hints--
 
-All tests should pass.
+Tutti i test dovrebbero essere superati.
 
 ```js
 (getUserInput) =>
@@ -30,7 +30,7 @@ All tests should pass.
   );
 ```
 
-You should choose the correct method for the first assertion - `isArray` vs. `isNotArray`.
+Dovresti scegliere il metodo corretto per la prima asserzione - `isArray` oppure `isNotArray`.
 
 ```js
 (getUserInput) =>
@@ -48,7 +48,7 @@ You should choose the correct method for the first assertion - `isArray` vs. `is
   );
 ```
 
-You should choose the correct method for the second assertion - `isArray` vs. `isNotArray`.
+Dovresti scegliere il metodo corretto per la seconda asserzione - `isArray` oppure `isNotArray`.
 
 ```js
 (getUserInput) =>
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
index 54540528da..0a2abcc563 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d824e367417b2b2512c55
-title: Test if an Object has a Property
+title: Verificare se un oggetto ha una proprietà
 challengeType: 2
 forumTopicId: 301604
 dashedName: test-if-an-object-has-a-property
@@ -8,17 +8,17 @@ 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/).
+Come promemoria, questo progetto viene costruito a partire dal seguente progetto iniziale su [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), o clonato da [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
 
-`property` asserts that the actual object has a given property.
+`property` asserisce che l'oggetto effettivo ha una data proprietà.
 
 # --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.
+All'interno di `tests/1_unit-tests.js`, sotto il test etichettato con `#16`, nella suite `Objects`, cambia ogni asserzione `assert` in `assert.property` o `assert.notProperty` per far passare il test (dovrebbe risultare `true`). Non alterare gli argomenti passati alle asserzioni.
 
 # --hints--
 
-All tests should pass.
+Tutti i test dovrebbero essere superati.
 
 ```js
 (getUserInput) =>
@@ -32,7 +32,7 @@ All tests should pass.
   );
 ```
 
-You should choose the correct method for the first assertion - `property` vs. `notProperty`.
+Dovresti scegliere il metodo corretto per la prima asserzione - `property` oppure `notProperty`.
 
 ```js
 (getUserInput) =>
@@ -50,7 +50,7 @@ You should choose the correct method for the first assertion - `property` vs. `n
   );
 ```
 
-You should choose the correct method for the second assertion - `property` vs. `notProperty`.
+Dovresti scegliere il metodo corretto per la seconda asserzione - `property` oppure `notProperty`.
 
 ```js
 (getUserInput) =>
@@ -68,7 +68,7 @@ You should choose the correct method for the second assertion - `property` vs. `
   );
 ```
 
-You should choose the correct method for the third assertion - `property` vs. `notProperty`.
+Dovresti scegliere il metodo corretto per la terza asserzione - `property` oppure `notProperty`.
 
 ```js
 (getUserInput) =>
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
index 6855c8a644..81f671169a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d824e367417b2b2512c57
-title: Test if an Object is an Instance of a Constructor
+title: Verificare se un oggetto è l'istanza di un costruttore
 challengeType: 2
 forumTopicId: 301605
 dashedName: test-if-an-object-is-an-instance-of-a-constructor
@@ -8,17 +8,17 @@ 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/).
+Come promemoria, questo progetto viene costruito a partire dal seguente progetto iniziale su [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), o clonato da [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
 
-`#instanceOf` asserts that an object is an instance of a constructor.
+`#instanceOf` afferma che un oggetto è un'istanza di un costruttore.
 
 # --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.
+All'interno di `tests/1_unit-tests.js`, sotto il test etichettato con `#18`, nella suite `Objects`, cambia ogni asserzione `assert` in `assert.instanceOf` o `assert.notInstanceOf` per far superare il test (dovrebbe risultare `true`). Non alterare gli argomenti passati alle asserzioni.
 
 # --hints--
 
-All tests should pass.
+Tutti i test dovrebbero essere superati.
 
 ```js
 (getUserInput) =>
@@ -32,7 +32,7 @@ All tests should pass.
   );
 ```
 
-You should choose the correct method for the first assertion - `instanceOf` vs. `notInstanceOf`.
+Dovresti scegliere il metodo corretto per la prima asserzione - `instanceOf` oppure `notInstanceOf`.
 
 ```js
 (getUserInput) =>
@@ -50,7 +50,7 @@ You should choose the correct method for the first assertion - `instanceOf` vs.
   );
 ```
 
-You should choose the correct method for the second assertion - `instanceOf` vs. `notInstanceOf`.
+Dovresti scegliere il metodo corretto per la seconda asserzione - `instanceOf` oppure `notInstanceOf`.
 
 ```js
 (getUserInput) =>
@@ -68,7 +68,7 @@ You should choose the correct method for the second assertion - `instanceOf` vs.
   );
 ```
 
-You should choose the correct method for the third assertion - `instanceOf` vs. `notInstanceOf`.
+Dovresti scegliere il metodo corretto per la terza asserzione - `instanceOf` oppure `notInstanceOf`.
 
 ```js
 (getUserInput) =>
@@ -86,7 +86,7 @@ You should choose the correct method for the third assertion - `instanceOf` vs.
   );
 ```
 
-You should choose the correct method for the fourth assertion - `instanceOf` vs. `notInstanceOf`.
+Dovresti scegliere il metodo corretto per la quarta asserzione - `instanceOf` oppure `notInstanceOf`.
 
 ```js
 (getUserInput) =>
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
index cf5da7e951..a16412d8ba 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d824b367417b2b2512c48
-title: Use Assert.isOK and Assert.isNotOK
+title: Usa Assert.isOK e Assert.isNotOK
 challengeType: 2
 forumTopicId: 301607
 dashedName: use-assert-isok-and-assert-isnotok
@@ -8,19 +8,19 @@ 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/).
+Come promemoria, questo progetto viene costruito a partire dal seguente progetto iniziale su [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), o clonato da [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
 
-`isOk()` will test for a truthy value, and `isNotOk()` will test for a falsy value.
+`isOk()` verificherà se un valore è veritiero e `isNotOk()` verificherà se un valore è falso.
 
-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.
+Per saperne di più sui valori veritieri e falsi, prova la nostra sfida [Falsy Bouncer](https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer).
 
 # --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.
+All'interno di `tests/1_unit-tests.js`, sotto il test etichettato con `#3`, nella suite `Basic Assertions`, cambia ogni asserzione `assert` in `assert.isOk()` o `assert.isNotOk()` per far superare il test (dovrebbe risultare `true`). Non alterare gli argomenti passati alle asserzioni.
 
 # --hints--
 
-All tests should pass.
+Tutti i test dovrebbero essere superati.
 
 ```js
 (getUserInput) =>
@@ -34,7 +34,7 @@ All tests should pass.
   );
 ```
 
-You should choose the correct method for the first assertion - `isOk` vs. `isNotOk`.
+Dovresti scegliere il metodo corretto per la prima asserzione - `isOk` oppure `isNotOk`.
 
 ```js
 (getUserInput) =>
@@ -48,7 +48,7 @@ You should choose the correct method for the first assertion - `isOk` vs. `isNot
   );
 ```
 
-You should choose the correct method for the second assertion - `isOk` vs. `isNotOk`.
+Dovresti scegliere il metodo corretto per la seconda asserzione - `isOk` oppure `isNotOk`.
 
 ```js
 (getUserInput) =>
@@ -62,7 +62,7 @@ You should choose the correct method for the second assertion - `isOk` vs. `isNo
   );
 ```
 
-You should choose the correct method for the third assertion - `isOk` vs. `isNotOk`.
+Dovresti scegliere il metodo corretto per la terza asserzione - `isOk` oppure `isNotOk`.
 
 ```js
 (getUserInput) =>
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
index 676b8b07b8..c2e2a2c495 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d824d367417b2b2512c54
-title: Use Regular Expressions to Test a String
+title: Usare espressioni regolari per testare una stringa
 challengeType: 2
 forumTopicId: 301608
 dashedName: use-regular-expressions-to-test-a-string
@@ -8,17 +8,17 @@ 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/).
+Come promemoria, questo progetto viene costruito a partire dal seguente progetto iniziale su [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), o clonato da [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
 
-`match()` asserts that the actual value matches the second argument regular expression.
+`match()` afferma che il valore effettivo corrisponde al secondo argomento espressione regolare.
 
 # --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.
+All'interno di `tests/1_unit-tests.js`, sotto il test etichettato con `#15`, nella suite `Strings`, cambia ogni asserzione `assert` in `assert.match` o `assert.notMatch` per far passare il test (dovrebbe risultare `true`). Non alterare gli argomenti passati alle asserzioni.
 
 # --hints--
 
-All tests should pass.
+Tutti i test dovrebbero essere superati.
 
 ```js
 (getUserInput) =>
@@ -32,7 +32,7 @@ All tests should pass.
   );
 ```
 
-You should choose the correct method for the first assertion - `match` vs. `notMatch`.
+Dovresti scegliere il metodo corretto per la prima asserzione - `match` oppure `notMatch`.
 
 ```js
 (getUserInput) =>
@@ -50,7 +50,7 @@ You should choose the correct method for the first assertion - `match` vs. `notM
   );
 ```
 
-You should choose the correct method for the second assertion - `match` vs. `notMatch`.
+Dovresti scegliere il metodo corretto per la seconda asserzione - `match` oppure `notMatch`.
 
 ```js
 (getUserInput) =>
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
index 5f932d6168..fcf93d0f6b 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 5e601c0d5ac9d0ecd8b94afe
-title: American British Translator
+title: Traduttore Americano Britannico
 challengeType: 4
 forumTopicId: 462358
 dashedName: american-british-translator
@@ -8,62 +8,62 @@ 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:
+Costruisci un'app JavaScript full-stack che sia funzionalmente simile a questa: <https://american-british-translator.freecodecamp.rocks/>. Lavorare su questo progetto ti porterà a scrivere il tuo codice utilizzando uno dei seguenti metodi:
 
--   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.
+-   Clona [questo repository GitHub](https://github.com/freeCodeCamp/boilerplate-project-american-british-english-translator/) e completa il tuo progetto localmente.
+-   Usa [il nostro progetto di avvio Replit](https://replit.com/github/freeCodeCamp/boilerplate-project-american-british-english-translator) per completare il tuo progetto.
+-   Usa un costruttore di siti di tua scelta per completare il progetto. Assicurati di incorporare tutti i file del nostro repository GitHub.
 
-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.
+Quando hai finito, assicurati che una demo funzionante del tuo progetto sia ospitata in qualche percorso pubblico. Quindi invia l'URL nel campo `Solution Link`. Facoltativamente, invia anche un link al codice sorgente del tuo progetto nel campo `GitHub Link`.
 
 # --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"
+-   Tutta la logica può stare in `/components/translator.js`
+-   Completa la rotta `/api/translate` in `/routes/api.js`
+-   Crea tutti i test delle unità/funzionali in `tests/1_unit-tests.js` e `tests/2_functional-tests.js`
+-   Vedi i file JavaScript in `/components` per la diversa ortografia e i termini che la tua applicazione dovrebbe tradurre
+-   Per eseguire i test su Replit, imposta `NODE_ENV` a `test` senza virgolette nel file `.env`
+-   Per eseguire i test nella console, utilizza il comando `npm run test`. Per aprire la console di Replit, premi Ctrl+Maiusc+P (Cmd se su un Mac) e digita "open shell"
 
-Write the following tests in `tests/1_unit-tests.js`:
+Scrivi i seguenti test 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.`
+-   Traduci `Mangoes are my favorite fruit.` in inglese britannico
+-   Traduci `I ate yogurt for breakfast.` in inglese britannico
+-   Traduci `We had a party at my friend's condo.` in inglese britannico
+-   Traduci `Can you toss this in the trashcan for me?` in inglese britannico
+-   Traduci `The parking lot was full.` in inglese britannico
+-   Traduci `Like a high tech Rube Goldberg machine.` in inglese britannico
+-   Traduci `To play hooky means to skip class or work.` in inglese britannico
+-   Traduci `No Mr. Bond, I expect you to die.` in inglese britannico
+-   Traduci `Dr. Grosh will see you now.` in inglese britannico
+-   Traduci `Lunch is at 12:15 today.` in inglese britannico
+-   Traduci `We watched the footie match for a while.` in inglese americano
+-   Traduci `Paracetamol takes up to an hour to work.` in inglese americano
+-   Traduci `First, caramelise the onions.` in inglese americano
+-   Traduci `I spent the bank holiday at the funfair.` in inglese americano
+-   Traduci `I had a bicky then went to the chippy.` in inglese americano
+-   Traduci `I've just got bits and bobs in my bum bag.` in inglese americano
+-   Traduci `The car boot sale at Boxted Airfield was called off.` in inglese americano
+-   Traduci `Have you met Mrs Kalyani?` in inglese americano
+-   Traduci `Prof Joyner of King's College, London.` in inglese americano
+-   Traduci `Tea time is usually around 4 or 4.30.` in inglese americano
+-   Evidenzia la traduzione in `Mangoes are my favorite fruit.`
+-   Evidenzia la traduzione in `I ate yogurt for breakfast.`
+-   Evidenzia la traduzione in `We watched the footie match for a while.`
+-   Evidenzia la traduzione in `Paracetamol takes up to an hour to work.`
 
-Write the following tests in `tests/2_functional-tests.js`:
+Scrivi i seguenti test 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`
+-   Traduzione con i campi testo e localizzazione: richiesta POST a `/api/translate`
+-   Traduzione con i campi testo e localizzazione non validi: richiesta POST a `/api/translate`
+-   Traduzione con il campo testo mancante: richiesta POST a `/api/translate`
+-   Traduzione con il campo localizzazione mancante: richiesta POST a `/api/translate`
+-   Traduzione con il testo vuoto: richiesta POST a `/api/translate`
+-   Traduzione con testo che non ha bisogno di traduzione: richiesta POST a `/api/translate`
 
 # --hints--
 
-I can provide my own project, not the example URL.
+È necessario fornire il proprio progetto, non l'URL di esempio.
 
 ```js
 (getUserInput) => {
@@ -75,7 +75,7 @@ I can provide my own project, not the example 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.
+Puoi fare una richiesta `POST` a `/api/translate` con un corpo contenente `text` con il testo da tradurre e `locale` con `american-to-british` (da americano a britannico) o `british-to-american` (da britannico ad americano). L'oggetto restituito dovrebbe contenere il testo inviato (`text`) e la traduzione (`translation`).
 
 ```js
 async (getUserInput) => {
@@ -103,7 +103,7 @@ async (getUserInput) => {
 };
 ```
 
-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>`.
+Il percorso `/api/translate` dovrebbe gestire la differenza di come l'ora è scritta in inglese americano o britannico. Per esempio l'orario dieci e trenta è scritto "10.30" in inglese britannico e "10:30" in inglese americano. L'elemento `span` dovrebbe racchiudere tutta la stringa del tempo, per esempio `<span class="highlight">10:30</span>`.
 
 ```js
 async (getUserInput) => {
@@ -130,7 +130,7 @@ async (getUserInput) => {
 };
 ```
 
-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 `/components/american-to-british-titles.js` for the different titles your application should handle.
+Il percorso `/api/translate` dovrebbe gestire anche la differenza di come i titoli onorifici sono abbreviati in inglese americano o britannico. Per esempio, Doctor Wright è appreviato come "Dr Wright" in inglese britannico e "Dr. Wright" in inglese americano. Vedi `/components/american-to-british-titles.js` per sapere quali titoli la tua applicazione dpvrebbe essere in grado di gestire.
 
 ```js
 async (getUserInput) => {
@@ -157,7 +157,7 @@ async (getUserInput) => {
 };
 ```
 
-Wrap any translated spelling or terms with `<span class="highlight">...</span>` tags so they appear in green.
+Racchiudi ogni traduzione di spelling o termini con tag `<span class="highlight">...</span>` affinchè appaiano in verde.
 
 ```js
 async (getUserInput) => {
@@ -185,7 +185,7 @@ async (getUserInput) => {
 };
 ```
 
-If one or more of the required fields is missing, return `{ error: 'Required field(s) missing' }`.
+Se uno o più dei campi richiesti è mancante, restuisci `{ error: 'Required field(s) missing' }`.
 
 ```js
 async (getUserInput) => {
@@ -206,7 +206,7 @@ async (getUserInput) => {
 };
 ```
 
-If `text` is empty, return `{ error: 'No text to translate' }`
+Se `text` è vuoto restuisci `{ error: 'No text to translate' }`
 
 ```js
 async (getUserInput) => {
@@ -227,7 +227,7 @@ async (getUserInput) => {
 };
 ```
 
-If `locale` does not match one of the two specified locales, return `{ error: 'Invalid value for locale field' }`.
+Se `locale` non corrisponde a uno dei due locale specificati, restituisci `{ error: 'Invalid value for locale field' }`.
 
 ```js
 async (getUserInput) => {
@@ -249,7 +249,7 @@ async (getUserInput) => {
 };
 ```
 
-If `text` requires no translation, return `"Everything looks good to me!"` for the `translation` value.
+Se `text` non richiede traduzione, restituisci `"Everything looks good to me!"` per il valore `translation`.
 
 ```js
 async (getUserInput) => {
@@ -276,7 +276,7 @@ async (getUserInput) => {
 };
 ```
 
-All 24 unit tests are complete and passing. See `/tests/1_unit-tests.js` for the expected behavior you should write tests for.
+Tutti i 24 test unitari sono completati e superati. Vedi `/tests/1_unit-tests.js` per il comportamento previsto per il quale dovresti scrivere dei test.
 
 ```js
 async (getUserInput) => {
@@ -301,7 +301,7 @@ async (getUserInput) => {
 };
 ```
 
-All 6 functional tests are complete and passing. See `/tests/2_functional-tests.js` for the functionality you should write tests for.
+Tutti i 6 test funzionali sono completi e superati. Vedi `/tests/2_functional-tests.js` per le funzionalità per le quali dovresti scrivere dei test.
 
 ```js
 async (getUserInput) => {
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
index 4ed68341e9..9d53686941 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7da9367417b2b2512b67
-title: Add Elements to the End of an Array Using concat Instead of push
+title: Adicione Elementos ao Final de um Array usando concat em vez de push
 challengeType: 1
 forumTopicId: 301226
 dashedName: add-elements-to-the-end-of-an-array-using-concat-instead-of-push
@@ -8,50 +8,50 @@ 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.
+Programação funcional é basicamente criar e utilizar funções que não modificam os seus argumentos.
 
-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:
+O último desafio mostrou como usar o método `concat` para criar um novo array a partir da combinação de outros sem modificar os originais. Compare os métodos `concat` e `push`. O `push` adiciona um item ao final do array à esquerda do `.`. Ele modifica o array. Um exemplo:
 
 ```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.
+Modificamos `arr` para acomodar o novo valor: `[1, 2, 3, [4, 5, 6]]`. Mas não é assim que se faz em programação funcional.
 
-`concat` offers a way to add new items to the end of an array without any mutating side effects.
+O `concat` nos oferece uma forma de adicionar novos itens ao final de um array sem alterá-lo.
 
 # --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.
+Modifique a função `nonMutatingPush` de forma que ela use `concat` para adicionar `newItem` ao final de `original` em vez de `push`. A função deve retornar um array.
 
 # --hints--
 
-Your code should use the `concat` method.
+O seu código deve usar o método `concat`.
 
 ```js
 assert(code.match(/\.concat/g));
 ```
 
-Your code should not use the `push` method.
+O seu código não deve usar o método `push`.
 
 ```js
 assert(!code.match(/\.?[\s\S]*?push/g));
 ```
 
-The `first` array should not change.
+O primeiro array, `first`, não deve ser modificado.
 
 ```js
 assert(JSON.stringify(first) === JSON.stringify([1, 2, 3]));
 ```
 
-The `second` array should not change.
+O segundo array, `second`, não deve ser modificado.
 
 ```js
 assert(JSON.stringify(second) === JSON.stringify([4, 5]));
 ```
 
-`nonMutatingPush([1, 2, 3], [4, 5])` should return `[1, 2, 3, 4, 5]`.
+`nonMutatingPush([1, 2, 3], [4, 5])` deve retornar `[1, 2, 3, 4, 5]`.
 
 ```js
 assert(
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
index b225822761..9d858a425e 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dab367417b2b2512b6d
-title: Apply Functional Programming to Convert Strings to URL Slugs
+title: Use Programação Funcional para Converter Strings para <i>Slugs</i> de URL
 challengeType: 1
 forumTopicId: 301227
 dashedName: apply-functional-programming-to-convert-strings-to-url-slugs
@@ -8,45 +8,45 @@ 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`.
+Os últimos desafios cobriram uma série de métodos úteis de strings e arrays que usam princípios de programação funcional. Também aprendemos o poderoso método `reduce`, que é usado para reduzir arrays a um único valor. Seja para calcular médias ou para ordenação, qualquer operação de array pode ser feita ao usá-lo. Lembre-se que `map` e `filter` são casos especiais de `reduce`.
 
-Let's combine what we've learned to solve a practical problem.
+Vamos combinar o que aprendemos para resolver um problema prático.
 
-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.
+Muitos sites de gerenciamento de conteúdo (*content management sites*, CMS) usam o título das publicações como parte da URL para maior legibilidade. Por exemplo, se você publicar um artigo no Medium chamado `Pare de Usar reduce`, é provável que a URL use o título em sua composição: `.../pare-de-usar-reduce`. Talvez você já tenha percebido que acontece o mesmo no freeCodeCamp.
 
 # --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:
+Complete a função `urlSlug` para que ela converta a string `title` e a retorne sem maiúsculas e com hifens no lugar dos espaços. Você pode usar qualquer método coberto nesta seção, mas não use `replace`. Estes são os requisitos:
 
-The input is a string with spaces and title-cased words
+A entrada é uma string com espaços e letras maiúsculas
 
-The output is a string with the spaces between words replaced by a hyphen (`-`)
+A saída é uma string cujos espaços foram substituídos por hifens (`-`)
 
-The output should be all lower-cased letters
+A saída não deve conter letras maiúsculas
 
-The output should not have any spaces
+A saída não deve conter espaços
 
 # --hints--
 
-Your code should not use the `replace` method for this challenge.
+Você não pode usar o método `replace` neste desafio.
 
 ```js
 assert(!code.match(/\.?[\s\S]*?replace/g));
 ```
 
-`urlSlug("Winter Is Coming")` should return the string `winter-is-coming`.
+`urlSlug("Winter Is Coming")` deve retornar a string `winter-is-coming`.
 
 ```js
 assert(urlSlug('Winter Is Coming') === 'winter-is-coming');
 ```
 
-`urlSlug(" Winter Is  Coming")` should return the string `winter-is-coming`.
+`urlSlug(" Winter Is  Coming")` deve retornar a 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`.
+`urlSlug("A Mind Needs Books Like A Sword Needs A Whetstone")` deve retornar a string `a-mind-needs-books-like-a-sword-needs-a-whetstone`.
 
 ```js
 assert(
@@ -55,7 +55,7 @@ assert(
 );
 ```
 
-`urlSlug("Hold The Door")` should return the string `hold-the-door`.
+`urlSlug("Hold The Door")` deve retornar a string `hold-the-door`.
 
 ```js
 assert(urlSlug('Hold The Door') === 'hold-the-door');
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
index 0f401beeab..b4cd72b33a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8e367417b2b2512b5e
-title: Avoid Mutations and Side Effects Using Functional Programming
+title: Evite Mutações e Efeitos Colaterais usando Programação Funcional
 challengeType: 1
 forumTopicId: 301228
 dashedName: avoid-mutations-and-side-effects-using-functional-programming
@@ -8,39 +8,39 @@ 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.
+Caso você ainda não tenha descoberto, o problema do desafio anterior é com a chamada a `splice` na função `tabClose()`. Infelizmente, `splice` modifica o array original no qual opera e, por isso, a segunda chamada usou o array alterado, nos dando resultados inesperados.
 
-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.
+Este é apenas um pequeno exemplo - você chama uma função e passa uma variável, array ou objeto a ela; a função modifica a variável ou alguma coisa no objeto.
 
-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.
+Um dos principais princípios da programação funcional é que não devemos alterar coisas. Alterações levam a bugs. É mais fácil prever bugs quando se sabe que as funções não mudam nada. Incluindo os seus argumentos e as variáveis globais.
 
-The previous example didn't have any complicated operations but the `splice` method changed the original array, and resulted in a bug.
+No exemplo anterior não havia nenhuma operação complicada, mas o método `splice` modificou o array original e o resultado foi um 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.
+Lembre-se que, em programação funcional, modificar ou alterar coisas é chamado de <dfn>mutação</dfn> e a consequência é chamada de <dfn>efeito colateral</dfn>. Idealmente, uma função deveria ser uma <dfn>função pura</dfn>, que é uma função que não causa efeitos colaterais.
 
-Let's try to master this discipline and not alter any variable or object in our code.
+Vamos tentar dominar esta disciplina e não alterar nenhuma variável ou objeto em nosso código.
 
 # --instructions--
 
-Fill in the code for the function `incrementer` so it returns the value of the global variable `fixedValue` increased by one.
+Complete o código da função `incrementer` para que ela retorne o valor da variável global `fixedValue` acrescida em um.
 
 # --hints--
 
-Your function `incrementer` should not change the value of `fixedValue` (which is `4`).
+Sua função `incrementer` não deve alterar o valor de `fixedValue` (que é `4`).
 
 ```js
 incrementer();
 assert(fixedValue === 4);
 ```
 
-Your `incrementer` function should return a value that is one larger than the `fixedValue` value.
+Sua função `incrementer` deve retornar um valor que é maior que o valor `fixedValue`.
 
 ```js
 const __newValue = incrementer();
 assert(__newValue === 5);
 ```
 
-Your `incrementer` function should return a value based on the global `fixedValue` variable value.
+Sua função `incrementer` deve retornar um valor baseado no valor da variável global `fixedValue`.
 
 ```js
 (function () {
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
index 350d529690..850c5ffd7d 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7daa367417b2b2512b6c
-title: Combine an Array into a String Using the join Method
+title: Transforme um Array em uma String Usando o Método join
 challengeType: 1
 forumTopicId: 18221
 dashedName: combine-an-array-into-a-string-using-the-join-method
@@ -8,47 +8,47 @@ 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.
+O método `join` é usado para juntar os elementos de um array, resultando em uma string. Ele recebe um delimitador como argumento, que é usado para conectar os elementos na string.
 
-Here's an example:
+Um exemplo:
 
 ```js
 var arr = ["Hello", "World"];
 var str = arr.join(" ");
 ```
 
-`str` would have a value of the string `Hello World`.
+O valor de `str` é `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.
+Use o método `join` (junto com outros) dentro da função `sentensify` para criar uma frase a partir das palavras da string `str`. A função deve retornar uma string. Por exemplo, `I-like-Star-Wars` deve ser convertido para `I like Star Wars`. Não use o método `replace` neste desafio.
 
 # --hints--
 
-Your code should use the `join` method.
+Você deve usar o método `join`.
 
 ```js
 assert(code.match(/\.join/g));
 ```
 
-Your code should not use the `replace` method.
+Você não deve usar o método `replace`.
 
 ```js
 assert(!code.match(/\.?[\s\S]*?replace/g));
 ```
 
-`sentensify("May-the-force-be-with-you")` should return a string.
+`sentensify("May-the-force-be-with-you")` deve retornar uma 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`.
+`sentensify("May-the-force-be-with-you")` deve retornar a 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`.
+`sentensify("The.force.is.strong.with.this.one")` deve retornar a string `The force is strong with this one`.
 
 ```js
 assert(
@@ -57,7 +57,7 @@ assert(
 );
 ```
 
-`sentensify("There,has,been,an,awakening")` should return the string `There has been an awakening`.
+`sentensify("There,has,been,an,awakening")` deve retornar a string `There has been an awakening`.
 
 ```js
 assert(
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
index 22afb596f1..ab77c4b4ed 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7da9367417b2b2512b66
-title: Combine Two Arrays Using the concat Method
+title: Combine Dois Arrays Usando o Método concat
 challengeType: 1
 forumTopicId: 301229
 dashedName: combine-two-arrays-using-the-concat-method
@@ -8,39 +8,39 @@ 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:
+<dfn>Concatenação</dfn> significa juntar itens de ponta a ponta. Em JavaScript, ambos strings e arrays possuem o método `concat` e ele funciona igualmente para os dois. Para arrays, o método é chamado em uma instância e um segundo array é passado como argumento. `concat` então junta os dois arrays em um só. O método retorna um novo array e deixa os dois originais intactos. Um exemplo:
 
 ```js
 [1, 2, 3].concat([4, 5, 6]);
 ```
 
-The returned array would be `[1, 2, 3, 4, 5, 6]`.
+`[1, 2, 3, 4, 5, 6]` é o array retornado.
 
 # --instructions--
 
-Use the `concat` method in the `nonMutatingConcat` function to concatenate `attach` to the end of `original`. The function should return the concatenated array.
+Use o método `concat` na função `nonMutatingConcat` para concatenar `attach` ao final de `original`. A função deve retornar o array concatenado.
 
 # --hints--
 
-Your code should use the `concat` method.
+Você deve usar o método `concat`.
 
 ```js
 assert(code.match(/\.concat/g));
 ```
 
-The `first` array should not change.
+O primeiro array, `first`, não deve ser alterado.
 
 ```js
 assert(JSON.stringify(first) === JSON.stringify([1, 2, 3]));
 ```
 
-The `second` array should not change.
+O segundo array, `second`, não deve ser alterado.
 
 ```js
 assert(JSON.stringify(second) === JSON.stringify([4, 5]));
 ```
 
-`nonMutatingConcat([1, 2, 3], [4, 5])` should return `[1, 2, 3, 4, 5]`.
+`nonMutatingConcat([1, 2, 3], [4, 5])` deve retornar `[1, 2, 3, 4, 5]`.
 
 ```js
 assert(
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
index b1098b2b28..734b5e2335 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8f367417b2b2512b62
-title: Implement map on a Prototype
+title: Implemente map em um Protótipo
 challengeType: 1
 forumTopicId: 301230
 dashedName: implement-map-on-a-prototype
@@ -8,25 +8,25 @@ 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.
+Como você viu ao aplicar `Array.prototype.map()`, ou simplesmente `map()` mais cedo, o método `map` retorna um array do mesmo tamanho que o no qual chamamos o método. Ele também não altera o array original desde que a sua função callback não o faça.
 
-In other words, `map` is a pure function, and its output depends solely on its inputs. Plus, it takes another function as its argument.
+Em outras palavras, `map` é uma função pura e a sua saída depende somente de suas entradas. Além disso, ele recebe outra função como argumento.
 
-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()`.
+Você pode aprender muito sobre o método `map` se você implementá-lo por conta própria. Recomenda-se que você use um loop `for` ou o método `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`.
+Escreva o seu próprio `Array.prototype.myMap()` e faça com que ele se comporte como o `Array.prototype.map()`. Você não deve usar o método `map` disponibilizado. O objeto `Array` pode ser acessado dentro de `myMap` pelo `this`.
 
 # --hints--
 
-`new_s` should equal `[46, 130, 196, 10]`.
+`new_s` deve ser `[46, 130, 196, 10]`.
 
 ```js
 assert(JSON.stringify(new_s) === JSON.stringify([46, 130, 196, 10]));
 ```
 
-Your code should not use the `map` method.
+Você não deve usar o método `map`.
 
 ```js
 assert(!code.match(/\.?[\s\S]*?map/g));
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
index a9469de977..a7af366424 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8f367417b2b2512b64
-title: Implement the filter Method on a Prototype
+title: Implemente o Método filter em um Protótipo
 challengeType: 1
 forumTopicId: 301231
 dashedName: implement-the-filter-method-on-a-prototype
@@ -8,21 +8,21 @@ 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()`.
+Você pode aprender muito sobre o método `filter` se você implementá-lo por conta própria. Recomenda-se que você use um loop `for` ou o método `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`.
+Escreva o seu próprio `Array.prototype.myFilter()` e faça com que ele se comporte como o `Array.prototype.filter()`. Você não deve usar o método `filter` disponibilizado. O objeto `Array` pode ser acessado dentro de `myFilter` pelo `this`.
 
 # --hints--
 
-`new_s` should equal `[23, 65, 5]`.
+`new_s` deve ser `[23, 65, 5]`.
 
 ```js
 assert(JSON.stringify(new_s) === JSON.stringify([23, 65, 5]));
 ```
 
-Your code should not use the `filter` method.
+Você não deve usar o método `filter`.
 
 ```js
 assert(!code.match(/\.?[\s\S]*?filter/g));
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
index 5576adac56..44c221a379 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dab367417b2b2512b70
-title: Introduction to Currying and Partial Application
+title: Introdução à Aplicação Parcial e Currying
 challengeType: 1
 forumTopicId: 301232
 dashedName: introduction-to-currying-and-partial-application
@@ -8,11 +8,11 @@ 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.
+A <dfn>aridade</dfn> de uma função é o número de argumentos que ela toma. Realizar <dfn>currying</dfn> em uma função significa transformar uma função de aridade N em N funções de aridade 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.
+Em outras palavras, a função é reestruturada para que ela receba apenas um argumento e retorne outra função que recebe o próximo argumento e assim por diante.
 
-Here's an example:
+Um exemplo:
 
 ```js
 function unCurried(x, y) {
@@ -30,16 +30,16 @@ const curried = x => y => x + y
 curried(1)(2)
 ```
 
-`curried(1)(2)` would return `3`.
+`curried(1)(2)` retornaria `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:
+Isso é útil em seu programa quando você não pode fornecer todos os argumentos para uma função de uma só vez. Você pode salvar cada chamada de função em uma variável, que será uma referência à função retornada que recebe o próximo argumento quando ele estiver disponível. Um exemplo usando a função do exemplo acima:
 
 ```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:
+Da mesma forma, <dfn>aplicação parcial</dfn> pode ser descrita como a aplicação de alguns argumentos a uma função e o retorno de outra função à qual é aplicada a mais argumentos. Um exemplo:
 
 ```js
 function impartial(x, y, z) {
@@ -51,29 +51,29 @@ partialFn(10); // 13
 
 # --instructions--
 
-Fill in the body of the `add` function so it uses currying to add parameters `x`, `y`, and `z`.
+Complete a função `add` de forma que ela use currying para adicionar os parâmetros `x`, `y` e `z`.
 
 # --hints--
 
-`add(10)(20)(30)` should return `60`.
+`add(10)(20)(30)` deve retornar `60`.
 
 ```js
 assert(add(10)(20)(30) === 60);
 ```
 
-`add(1)(2)(3)` should return `6`.
+`add(1)(2)(3)` deve retornar `6`.
 
 ```js
 assert(add(1)(2)(3) === 6);
 ```
 
-`add(11)(22)(33)` should return `66`.
+`add(11)(22)(33)` deve retornar `66`.
 
 ```js
 assert(add(11)(22)(33) === 66);
 ```
 
-Your code should include a final statement that returns `x + y + z`.
+Em seu código deve haver uma instrução final que retorna `x + y + z`.
 
 ```js
 assert(code.match(/[xyz]\s*?\+\s*?[xyz]\s*?\+\s*?[xyz]/g));
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
index c96910a483..34539206bf 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8d367417b2b2512b5b
-title: Learn About Functional Programming
+title: Aprenda Sobre Programação Funcional
 challengeType: 1
 forumTopicId: 301233
 dashedName: learn-about-functional-programming
@@ -8,31 +8,31 @@ 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`
+Programação funcional é um estilo de programação em que as soluções são funções simples, isoladas e livres de efeitos colaterais fora do escopo da função: `ENTRADA -> PROCESSAMENTO -> SAÍDA`
 
-Functional programming is about:
+Quando falamos de programação funcional, pensamos em:
 
-1) Isolated functions - there is no dependence on the state of the program, which includes global variables that are subject to change
+1) Funções isoladas: nenhuma função depende do estado do programa, incluindo variáveis globais, que podem sofrer mudanças
 
-2) Pure functions - the same input always gives the same output
+2) Funções puras: a mesma entrada sempre devolve a mesma saída
 
-3) Functions with limited side effects - any changes, or mutations, to the state of the program outside the function are carefully controlled
+3) Funções com efeitos colaterais limitados: qualquer alteração ou mutação do estado do programa fora da função é cuidadosamente controlada
 
 # --instructions--
 
-The members of freeCodeCamp happen to love tea.
+Os membros do freeCodeCamp adoram chá.
 
-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.
+As funções `prepareTea` e `getTea` já estão definidas para você no editor de texto. Chame a função `getTea` para adquirir 40 xícaras de chá para o time e as armazene na variável `tea4TeamFCC`.
 
 # --hints--
 
-The `tea4TeamFCC` variable should hold 40 cups of tea for the team.
+A variável `tea4TeamFCC` deve conter 40 xícaras de chá para o time.
 
 ```js
 assert(tea4TeamFCC.length === 40);
 ```
 
-The `tea4TeamFCC` variable should hold cups of green tea.
+A variável `tea4TeamFCC` deve conter xícaras de chá verde.
 
 ```js
 assert(tea4TeamFCC[0] === 'greenTea');
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
index 19d7d355e9..4f171c69e9 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8e367417b2b2512b5f
-title: Pass Arguments to Avoid External Dependence in a Function
+title: Passe Argumentos para Evitar Dependências Externas em Funções
 challengeType: 1
 forumTopicId: 301234
 dashedName: pass-arguments-to-avoid-external-dependence-in-a-function
@@ -8,39 +8,39 @@ 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.
+No último desafio você deu um passo a mais nos princípios de programação funcional, mas ainda falta algo.
 
-We didn't alter the global variable value, but the function `incrementer` would not work without the global variable `fixedValue` being there.
+Nós não mudamos o valor dela, mas a função `incrementer` não funciona sem a variável global `fixedValue`.
 
-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.
+Outro princípio da programação funcional é que sempre devemos declarar nossas dependências explicitamente. Isso significa que, se uma função depende de uma variável ou objeto, então devemos passar esta variável ou objeto diretamente como argumento a ela.
 
-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.
+Há muitas boas consequências nesse princípio: a função se torna mais fácil de testar, você sabe exatamente quais são as suas entradas e ela não depende de mais nada no seu programa.
 
-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.
+Isso faz com que você tenha mais confiança ao alterar, remover ou adicionar código, pois sabe o que pode ou não pode alterar e identifica armadilhas em potencial com mais facilidade.
 
-Finally, the function would always produce the same output for the same set of inputs, no matter what part of the code executes it.
+Finalmente, a função sempre produzirá a mesma saída para o mesmo conjunto de entradas, não importa de onde no código ela é chamada.
 
 # --instructions--
 
-Let's update the `incrementer` function to clearly declare its dependencies.
+Vamos atualizar a função `incrementer` e declarar explicitamente as suas dependências.
 
-Write the `incrementer` function so it takes an argument, and then returns a result after increasing the value by one.
+Escreva a função `incrementer` de forma que ela receba um argumento e retorne o valor incrementado em um.
 
 # --hints--
 
-Your function `incrementer` should not change the value of `fixedValue` (which is `4`).
+A função `incrementer` não deve alterar o valor de `fixedValue`, que é `4`.
 
 ```js
 assert(fixedValue === 4);
 ```
 
-Your `incrementer` function should take an argument.
+A função `incrementer` deve receber um argumento.
 
 ```js
 assert(incrementer.length === 1);
 ```
 
-Your `incrementer` function should return a value that is one larger than the `fixedValue` value.
+Sua função `incrementer` deve retornar um valor que é maior que o valor `fixedValue`.
 
 ```js
 const __newValue = incrementer(fixedValue);
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
index 0eea537b77..698f7f4d57 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8f367417b2b2512b60
-title: Refactor Global Variables Out of Functions
+title: Refatore Funções Para Que Não Usem Variáveis Globais
 challengeType: 1
 forumTopicId: 301235
 dashedName: refactor-global-variables-out-of-functions
@@ -8,23 +8,23 @@ dashedName: refactor-global-variables-out-of-functions
 
 # --description--
 
-So far, we have seen two distinct principles for functional programming:
+Até agora vimos dois princípios diferentes de programação funcional:
 
-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`.
+1) Não altere variáveis ou objetos: crie novas variáveis ou objetos e os retorne, caso necessário, de uma função. Dica: escrever algo como `var newArr = arrVar` onde `arrVar` é um array não o copiará para a nova a variável, e sim apenas criará uma nova referência ao mesmo objeto. Então mudar um valor em `newArr` também o muda em `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.
+2) Declare parâmetros de funções: qualquer computação dentro de uma função depende apenas dos argumentos passados a ela; nunca de uma variável ou objeto global.
 
-Adding one to a number is not very exciting, but we can apply these principles when working with arrays or more complex objects.
+Incrementar um número em um não é tão divertido, mas podemos aplicar esses princípios ao trabalhar com arrays ou objetos mais complexos.
 
 # --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.
+Reescreva o código de forma que o array global `bookList` não seja alterado em nenhuma das funções. A função `add` deve adicionar o nome do livro, `bookName` ao array passado e retornar um novo array. A função `remove` deve remover o `bookName` do array passado a ela.
 
-**Note:** Both functions should return an array, and any new parameters should be added before the `bookName` parameter.
+**Obs:** Ambas as funções devem retornar um array e novos parâmetros devem ser adicionados antes do parâmetro `bookName`.
 
 # --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"]`.
+`bookList` não deve ser alterado e precisa permanecer igual a `["The Hound of the Baskervilles", "On The Electrodynamics of Moving Bodies", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae"]`.
 
 ```js
 assert(
@@ -38,7 +38,7 @@ assert(
 );
 ```
 
-`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"]`.
+`newBookList` deve ser igual a `["The Hound of the Baskervilles", "On The Electrodynamics of Moving Bodies", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae", "A Brief History of Time"]`.
 
 ```js
 assert(
@@ -53,7 +53,7 @@ assert(
 );
 ```
 
-`newerBookList` should equal `["The Hound of the Baskervilles", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae"]`.
+`newerBookList` deve ser igual a `["The Hound of the Baskervilles", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae"]`.
 
 ```js
 assert(
@@ -66,7 +66,7 @@ assert(
 );
 ```
 
-`newestBookList` should equal `["The Hound of the Baskervilles", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae", "A Brief History of Time"]`.
+`newestBookList` deve ser igual a `["The Hound of the Baskervilles", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae", "A Brief History of Time"]`.
 
 ```js
 assert(
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
index e8e2542d9c..86041aafe9 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 9d7123c8c441eeafaeb5bdef
-title: Remove Elements from an Array Using slice Instead of splice
+title: Remova Elementos de um Array Usando slice em vez de splice
 challengeType: 1
 forumTopicId: 301236
 dashedName: remove-elements-from-an-array-using-slice-instead-of-splice
@@ -8,38 +8,38 @@ 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:
+É comum precisar remover alguns itens de um array e manter o resto. O JavaScript oferece o método `splice`, que recebe uma posição de onde começar a remover e o número de elementos para remover como argumentos para isso. Se o segundo argumento for omitido, o padrão é remover todos os itens até o final. No entanto, o método `splice` modifica o array original em que é chamado. Um exemplo:
 
 ```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"]`.
+Aqui `splice` retorna a string `London` e a remove do array cities. `cities` terá o valor `["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.
+Como vimos no último desafio, o método `slice` não altera o array original; ele retorna um novo array que pode ser armazenado em uma variável. Lembre-se que o método `slice` toma dois argumentos para os índices de início e fim e retorna um array com os elementos presentes entre esses índices (o índice de fim é não-inclusivo). Usar o método `slice` em vez do `splice` ajuda a evitar alterações em arrays e, portanto, efeitos colaterais.
 
 # --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.
+Reescreva a função `nonMutatingSplice` com `slice` em vez de `splice`. Ela deve limitar o array `cities` providenciado ao tamanho 3 e retornar um novo array com apenas os três primeiros itens.
 
-Do not mutate the original array provided to the function.
+Não modifique o array original passado à função.
 
 # --hints--
 
-Your code should use the `slice` method.
+Você deve usar o método `slice`.
 
 ```js
 assert(code.match(/\.slice/g));
 ```
 
-Your code should not use the `splice` method.
+Você não deve usar o método `splice`.
 
 ```js
 assert(!code.match(/\.?[\s\S]*?splice/g));
 ```
 
-The `inputCities` array should not change.
+O array `inputCities` não deve ser alterado.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-`nonMutatingSplice(["Chicago", "Delhi", "Islamabad", "London", "Berlin"])` should return `["Chicago", "Delhi", "Islamabad"]`.
+`nonMutatingSplice(["Chicago", "Delhi", "Islamabad", "London", "Berlin"])` deve retornar `["Chicago", "Delhi", "Islamabad"]`.
 
 ```js
 assert(
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
index ab1f85159f..bfa94458a3 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7da9367417b2b2512b6a
-title: Return a Sorted Array Without Changing the Original Array
+title: Retorne um Array Ordenado Sem Modificar o Array Original
 challengeType: 1
 forumTopicId: 301237
 dashedName: return-a-sorted-array-without-changing-the-original-array
@@ -8,27 +8,27 @@ 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.
+Um efeito colateral do método `sort` é que ele altera a ordem dos elementos no array original. Em outras palavras, o array sofre uma mutação. Uma forma de evitar isto é primeiro concatenar um array vazio ao array a ordenar (não esqueça que `slice` e `concat` retornam um novo array) e, então, executar o método `sort` no novo array.
 
 # --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.
+Use o método `sort`na função `nonMutatingSort` para ordenar os elementos de um array em ordem crescente. A função deve retornar um novo array sem alterar a variável `globalArray`.
 
 # --hints--
 
-Your code should use the `sort` method.
+Você deve usar o método `sort`.
 
 ```js
 assert(nonMutatingSort.toString().match(/\.sort/g));
 ```
 
-The `globalArray` variable should not change.
+A variável `globalArray` não deve ser alterada.
 
 ```js
 assert(JSON.stringify(globalArray) === JSON.stringify([5, 6, 3, 2, 9]));
 ```
 
-`nonMutatingSort(globalArray)` should return `[2, 3, 5, 6, 9]`.
+`nonMutatingSort(globalArray)` deve retornar `[2, 3, 5, 6, 9]`.
 
 ```js
 assert(
@@ -37,26 +37,26 @@ assert(
 );
 ```
 
-`nonMutatingSort(globalArray)` should not be hard coded.
+`nonMutatingSort(globalArray)` não deve conter um array prontamente ordenado.
 
 ```js
 assert(!nonMutatingSort.toString().match(/\[.*?[23569].*?\]/gs));
 ```
 
-The function should return a new array, not the array passed to it.
+A função deve retornar um novo array, não o array passado a ela.
 
 ```js
 assert(nonMutatingSort(globalArray) !== globalArray);
 ```
 
-`nonMutatingSort([1, 30, 4, 21, 100000])` should return `[1, 4, 21, 30, 100000]`.
+`nonMutatingSort([1, 30, 4, 21, 100000])` deve retornar `[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]`.
+`nonMutatingSort([140000, 104, 99])` deve retornar `[99, 104, 140000]`.
 
 ```js
 assert(JSON.stringify(nonMutatingSort([140000, 104, 99])) ===
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
index 2cf17e7466..12deb06771 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b90367417b2b2512b65
-title: Return Part of an Array Using the slice Method
+title: Retorne Parte de um Array Usando o Método slice
 challengeType: 1
 forumTopicId: 301239
 dashedName: return-part-of-an-array-using-the-slice-method
@@ -8,30 +8,30 @@ 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.
+O método `slice` retorna uma fatia de elementos de um array. Ele pode receber dois argumentos, sendo o primeiro o índice de onde começar a fatiar e o segundo de onde terminar. O índice de fim não é inclusivo. Se os argumentos não forem providenciados, o padrão é começar pelo início e terminar no fim, ou seja, é uma forma simples de criar uma cópia do array inteiro. O método `slice` retorna um novo array sem modificar o original.
 
-Here's an example:
+Um exemplo:
 
 ```js
 var arr = ["Cat", "Dog", "Tiger", "Zebra"];
 var newArray = arr.slice(1, 3);
 ```
 
-`newArray` would have the value `["Dog", "Tiger"]`.
+`newArray` terá o valor `["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.
+Use o método `slice` na função `sliceArray` para retornar parte do array `anim` dado os índices `beginSlice` e `endSlice` providenciados. A função deve retornar um array.
 
 # --hints--
 
-Your code should use the `slice` method.
+Você deve usar o método `slice`.
 
 ```js
 assert(code.match(/\.slice/g));
 ```
 
-The `inputAnim` variable should not change.
+A variável `inputAnim` não deve ser alterada.
 
 ```js
 assert(
@@ -40,7 +40,7 @@ assert(
 );
 ```
 
-`sliceArray(["Cat", "Dog", "Tiger", "Zebra", "Ant"], 1, 3)` should return `["Dog", "Tiger"]`.
+`sliceArray(["Cat", "Dog", "Tiger", "Zebra", "Ant"], 1, 3)` deve retornar `["Dog", "Tiger"]`.
 
 ```js
 assert(
@@ -49,7 +49,7 @@ assert(
 );
 ```
 
-`sliceArray(["Cat", "Dog", "Tiger", "Zebra", "Ant"], 0, 1)` should return `["Cat"]`.
+`sliceArray(["Cat", "Dog", "Tiger", "Zebra", "Ant"], 0, 1)` deve retornar `["Cat"]`.
 
 ```js
 assert(
@@ -58,7 +58,7 @@ assert(
 );
 ```
 
-`sliceArray(["Cat", "Dog", "Tiger", "Zebra", "Ant"], 1, 4)` should return `["Dog", "Tiger", "Zebra"]`.
+`sliceArray(["Cat", "Dog", "Tiger", "Zebra", "Ant"], 1, 4)` deve retornar `["Dog", "Tiger", "Zebra"]`.
 
 ```js
 assert(
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
index eac62b543b..65f2ba0f95 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7da9367417b2b2512b69
-title: Sort an Array Alphabetically using the sort Method
+title: Ordene um Array Alfabeticamente Usando o Método sort
 challengeType: 1
 forumTopicId: 18303
 dashedName: sort-an-array-alphabetically-using-the-sort-method
@@ -8,9 +8,9 @@ dashedName: sort-an-array-alphabetically-using-the-sort-method
 
 # --description--
 
-The `sort` method sorts the elements of an array according to the callback function.
+O método `sort` consegue ordenar os elementos de um array de acordo com uma função callback.
 
-For example:
+Por exemplo:
 
 ```js
 function ascendingOrder(arr) {
@@ -21,7 +21,7 @@ function ascendingOrder(arr) {
 ascendingOrder([1, 5, 2, 3, 4]);
 ```
 
-This would return the value `[1, 2, 3, 4, 5]`.
+O código acima retorna `[1, 2, 3, 4, 5]`.
 
 ```js
 function reverseAlpha(arr) {
@@ -32,23 +32,23 @@ function reverseAlpha(arr) {
 reverseAlpha(['l', 'h', 'z', 'b', 's']);
 ```
 
-This would return the value `['z', 's', 'l', 'h', 'b']`.
+Este retorna o valor `['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.
+O método de ordenação padrão do JavaScript é por valores de ponto Unicode, o que pode nos dar resultados inesperados. Por isso você é encorajado a providenciar uma função callback para especificar como a ordenação deve ocorrer. Quando tal função callback (comumente chamada de `compareFunction`, ou função de comparação) é providenciada, os elementos do array são ordenados de acordo com o valor de retorno dela: se `compareFunction(a,b)` retornar um valor menor que 0 para dois elementos `a` e `b`, então `a` virá antes de `b`. Se `compareFunction(a,b)` retornar um valor maior que 0 para dois elementos `a` e `b`, então `b` virá antes de `a`. Finalmente, se `compareFunction(a,b)` retornar 0, então `a` e `b` não trocarão de lugar entre si.
 
 # --instructions--
 
-Use the `sort` method in the `alphabeticalOrder` function to sort the elements of `arr` in alphabetical order.
+Use o método `sort` na função `alphabeticalOrder` para ordenar os elementos de `arr` em ordem alfabética.
 
 # --hints--
 
-Your code should use the `sort` method.
+Você deve usar o método `sort`.
 
 ```js
 assert(code.match(/\.sort/g));
 ```
 
-`alphabeticalOrder(["a", "d", "c", "a", "z", "g"])` should return `["a", "a", "c", "d", "g", "z"]`.
+`alphabeticalOrder(["a", "d", "c", "a", "z", "g"])` deve retornar `["a", "a", "c", "d", "g", "z"]`.
 
 ```js
 assert(
@@ -57,7 +57,7 @@ assert(
 );
 ```
 
-`alphabeticalOrder(["x", "h", "a", "m", "n", "m"])` should return `["a", "h", "m", "m", "n", "x"]`.
+`alphabeticalOrder(["x", "h", "a", "m", "n", "m"])` deve retornar `["a", "h", "m", "m", "n", "x"]`.
 
 ```js
 assert(
@@ -66,7 +66,7 @@ assert(
 );
 ```
 
-`alphabeticalOrder(["a", "a", "a", "a", "x", "t"])` should return `["a", "a", "a", "a", "t", "x"]`.
+`alphabeticalOrder(["a", "a", "a", "a", "x", "t"])` deve retornar `["a", "a", "a", "a", "t", "x"]`.
 
 ```js
 assert(
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
index d2d7eeeb9c..78e4cf8237 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7daa367417b2b2512b6b
-title: Split a String into an Array Using the split Method
+title: Divida uma String em um Array Usando o Método split
 challengeType: 1
 forumTopicId: 18305
 dashedName: split-a-string-into-an-array-using-the-split-method
@@ -8,9 +8,9 @@ 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.
+O método `split` divide uma string em um array de strings. Ela recebe um delimitador, que pode ser um caractere ou uma expressão regular, como argumento para dividir a string. Por exemplo, se o delimitador for um espaço, você recebe um array de palavras. Se o delimitador for a string vazia, você recebe um array contendo os caracteres da string.
 
-Here are two examples that split one string by spaces, then another by digits using a regular expression:
+Abaixo há dois exemplos de uso de split, um separando uma string por espaços, e outro por dígitos usando uma expressão regular:
 
 ```js
 var str = "Hello World";
@@ -20,23 +20,23 @@ 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"]`.
+`bySpace` terá o valor `["Hello", "World"]` e `byDigits` terá o valor `["How", "are", "you", "today"]`.
 
-Since strings are immutable, the `split` method makes it easier to work with them.
+Como strings são imutáveis, o método `split` facilita o trabalho com elas.
 
 # --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.
+Use o método `split` na função `splitify` para dividir `str` em um array de palavras. A função deve retornar o array. Note que as palavras nem sempre são separadas por espaços; o array não deve conter nenhuma pontuação.
 
 # --hints--
 
-Your code should use the `split` method.
+Você deve usar o método `split`.
 
 ```js
 assert(code.match(/\.split/g));
 ```
 
-`splitify("Hello World,I-am code")` should return `["Hello", "World", "I", "am", "code"]`.
+`splitify("Hello World,I-am code")` deve retornar `["Hello", "World", "I", "am", "code"]`.
 
 ```js
 assert(
@@ -45,7 +45,7 @@ assert(
 );
 ```
 
-`splitify("Earth-is-our home")` should return `["Earth", "is", "our", "home"]`.
+`splitify("Earth-is-our home")` deve retornar `["Earth", "is", "our", "home"]`.
 
 ```js
 assert(
@@ -54,7 +54,7 @@ assert(
 );
 ```
 
-`splitify("This.is.a-sentence")` should return `["This", "is", "a", "sentence"]`.
+`splitify("This.is.a-sentence")` deve retornar `["This", "is", "a", "sentence"]`.
 
 ```js
 assert(
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
index c292a9c493..3f540dac07 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8e367417b2b2512b5c
-title: Understand Functional Programming Terminology
+title: Entenda a Terminologia de Programação Funcional
 challengeType: 1
 forumTopicId: 301240
 dashedName: understand-functional-programming-terminology
@@ -8,47 +8,47 @@ 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.
+Houve uma mudança de humor no time da FCC e os membros agora querem dois tipos de chá: verde e preto. Fato: clientes sofrem mudanças de humor e de opinião frequentemente.
 
-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.
+Por causa disso, precisaremos rever a função `getTea` do último desafio para lidar com vários pedidos de chá. Podemos modificar a `getTea` para aceitar uma função como argumento e torná-la capaz de preparar outros tipos de chá. Isso faz com que `getTea` seja mais flexível e dá mais controle ao programador quando os requisitos do cliente mudam.
 
-But first, let's cover some functional terminology:
+Mas primeiro, vejamos um pouco de terminologia funcional:
 
-<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.
+<dfn>Callbacks</dfn> são funções que são passadas a outras funções, que decidem quando e como são chamados. Você pode ter visto alguns sendo passados a outros métodos. Em `filter`, por exemplo, o callback diz ao JavaScript qual é o critério para filtrar um 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.
+Funções que podem ser atribuídas a variáveis, passadas a outras funções ou retornadas de outra função como qualquer outro valor são chamadas de <dfn>funções de primeira classe</dfn>. Em JavaScript, todas as funções são funções de primeira classe.
 
-The functions that take a function as an argument, or return a function as a return value are called <dfn>higher order</dfn> functions.
+As funções que recebem funções como argumentos ou retornam outras funções como valores são chamadas de <dfn>funções de ordem superior</dfn>.
 
-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>.
+Funções podem ser chamadas de <dfn>lambda</dfn> quando passadas para outra função ou retornadas a partir dela.
 
 # --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.
+Prepare 27 xícaras de chá verde e 13 xícaras de chá preto; armazene-as nas variáveis `tea4GreenTeamFCC` e `tea4BlackTeamFCC`, respectivamente. Perceba que a função `getTea` foi alterada para receber uma função como primeiro argumento.
 
-Note: The data (the number of cups of tea) is supplied as the last argument. We'll discuss this more in later lessons.
+Obs: O número de xícaras de chá se tornou o último parâmetro da função. Discutiremos mais sobre isso nas próximas aulas.
 
 # --hints--
 
-The `tea4GreenTeamFCC` variable should hold 27 cups of green tea for the team.
+A variável `tea4GreenTeamFCC` deve conter 27 xícaras de chá verde para o time.
 
 ```js
 assert(tea4GreenTeamFCC.length === 27);
 ```
 
-The `tea4GreenTeamFCC` variable should hold cups of green tea.
+A variável `tea4GreenTeamFCC` deve conter xícaras de chá verde.
 
 ```js
 assert(tea4GreenTeamFCC[0] === 'greenTea');
 ```
 
-The `tea4BlackTeamFCC` variable should hold 13 cups of black tea.
+A variável `tea4BlackTeamFCC` deve conter 13 xícaras de chá preto.
 
 ```js
 assert(tea4BlackTeamFCC.length === 13);
 ```
 
-The `tea4BlackTeamFCC` variable should hold cups of black tea.
+A variável `tea4BlackTeamFCC` deve conter xícaras de chá preto.
 
 ```js
 assert(tea4BlackTeamFCC[0] === 'blackTea');
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
index f717be6c1e..086b884f8a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8e367417b2b2512b5d
-title: Understand the Hazards of Using Imperative Code
+title: Entenda os Perigos da Programação Imperativa
 challengeType: 1
 forumTopicId: 301241
 dashedName: understand-the-hazards-of-using-imperative-code
@@ -8,31 +8,31 @@ 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.
+Usar programação funcional é um bom hábito. Faz com que o seu código seja fácil de manter e o livra de bugs sorrateiros. Mas antes de fazer a transição, vamos rever uma abordagem imperativa para destacar onde pode haver problemas.
 
-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.
+Em português (e vários outros idiomas), o modo verbal imperativo é usado para dar ordens. Da mesma forma, o estilo imperativo em programação é um estilo que dá um conjunto de instruções para um computador realizar uma tarefa.
 
-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.
+Essas instruções frequentemente alteram o estado do programa ao atualizar variáveis globais, por exemplo. Um exemplo clássico é escrever um loop `for`, que é explícito ao dar direções para percorrer um 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.
+Em contrapartida, a programação funcional é uma forma de programação declarativa. Você diz ao computador o que quer fazer chamando um método ou função.
 
-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.
+O JavaScript oferece muitos métodos predefinidos que lidam com tarefas comuns, então você não precisa escrever como o computador deve executá-las. Por exemplo, em vez de usar um loop `for`, você pode chamar o método `map`, que lida com os detalhes de como percorrer um array. Isso ajuda a evitar erros semânticos, como o "Off By One", que foram cobertos na seção de depuração.
 
-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.
+Considere o cenário: você está navegando na web com o seu navegador e quer rastrear as abas que você abriu. Vamos tentar modelar isso usando orientação a objetos de forma simples.
 
-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.
+Um objeto Window (Janela) é composto de abas e normalmente há mais de uma janela aberta. Os títulos de cada site aberto em cada objeto Window é armazenado em um array. Depois de usar o navegador (abrindo novas abas, juntando janelas, fechando abas), você quer imprimir as abas que ainda estão abertas. Abas fechadas são removidas do array e novas abas são adicionadas ao fim dele (por simplicidade).
 
-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.
+No editor de texto há uma implementação dessa funcionalidade com as funções `tabOpen()`, `tabClose()` e `join()`. O array `tabs` é um atributo do objeto Window e armazena o nome das páginas abertas.
 
 # --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.
+Examine o código no editor. Nele é usado um método que possui efeitos colaterais no programa e causa comportamento incorreto. A lista final de abas abertas armazenada em `finalTabs.tabs` deveria ser `['FB', 'Gitter', 'Reddit', 'Twitter', 'Medium', 'new tab', 'Netflix', 'YouTube', 'Vine', 'GMail', 'Work mail', 'Docs', 'freeCodeCamp', 'new tab']` mas a lista produzida pelo código é ligeiramente diferente.
 
-Change `Window.prototype.tabClose` so that it removes the correct tab.
+Modifique `Window.prototype.tabClose` de forma que ele remova a aba correta.
 
 # --hints--
 
-`finalTabs.tabs` should be `['FB', 'Gitter', 'Reddit', 'Twitter', 'Medium', 'new tab', 'Netflix', 'YouTube', 'Vine', 'GMail', 'Work mail', 'Docs', 'freeCodeCamp', 'new tab']`
+`finalTabs.tabs` deve ser `['FB', 'Gitter', 'Reddit', 'Twitter', 'Medium', 'new tab', 'Netflix', 'YouTube', 'Vine', 'GMail', 'Work mail', 'Docs', 'freeCodeCamp', 'new tab']`
 
 ```js
 assert.deepEqual(finalTabs.tabs, [
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
index 3b80b6677c..38809ff43d 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b88367417b2b2512b45
-title: 'Use Higher-Order Functions map, filter, or reduce to Solve a Complex Problem'
+title: 'Use as Funções de Ordem Superior map, filter ou reduce para Solucionar um Problema Complexo'
 challengeType: 1
 forumTopicId: 301311
 dashedName: use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem
@@ -8,30 +8,30 @@ dashedName: use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-p
 
 # --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.
+Agora que você já realizou alguns desafios usando funções de ordem superior como `map()`, `filter()` e `reduce()`, você pode usá-las para resolver um desafio mais complexo.
 
 # --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]`.
+Complete o código para a função `squareList` usando qualquer combinação de `map()`, `filter()` e `reduce()`. A função deve retornar uma nova matriz contendo *apenas* os inteiros positivos (números decimais não são inteiros) elevados ao quadrado quando uma matriz de números reais é passada para ela. Um exemplo de array de números reais é `[-3, 4.8, 5, 3, -3.2]`.
 
-**Note:** Your function should not use any kind of `for` or `while` loops or the `forEach()` function.
+**Obs:** Você não deve usar os loops `for` ou `while` ou a função `forEach()` na sua função.
 
 # --hints--
 
-`squareList` should be a `function`.
+`squareList` deve ser uma <dfn>função</dfn>.
 
 ```js
 assert.typeOf(squareList, 'function'),
   '<code>squareList</code> should be a <code>function</code>';
 ```
 
-`for`, `while`, and `forEach` should not be used.
+Loops `for`, `while`e a função `forEach` não devem ser usados.
 
 ```js
 assert(!code.match(/for|while|forEach/g));
 ```
 
-`map`, `filter`, or `reduce` should be used.
+`map`, `filter` ou `reduce` deve ser usado.
 
 ```js
 assert(
@@ -41,13 +41,13 @@ assert(
 );
 ```
 
-The function should return an `array`.
+A função deve retornar um `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]`.
+`squareList([4, 5.6, -9.8, 3.14, 42, 6, 8.34, -2])` deve retornar `[16, 1764, 36]`.
 
 ```js
 assert.deepStrictEqual(squareList([4, 5.6, -9.8, 3.14, 42, 6, 8.34, -2]), [
@@ -57,7 +57,7 @@ assert.deepStrictEqual(squareList([4, 5.6, -9.8, 3.14, 42, 6, 8.34, -2]), [
 ]);
 ```
 
-`squareList([-3.7, -5, 3, 10, 12.5, 7, -4.5, -17, 0.3])` should return `[9, 100, 49]`.
+`squareList([-3.7, -5, 3, 10, 12.5, 7, -4.5, -17, 0.3])` deve retornar `[9, 100, 49]`.
 
 ```js
 assert.deepStrictEqual(squareList([-3.7, -5, 3, 10, 12.5, 7, -4.5, -17, 0.3]), [
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
index efea709677..bb3090e17a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dab367417b2b2512b6e
-title: Use the every Method to Check that Every Element in an Array Meets a Criteria
+title: Use o Método every para Checar Se Todos os Elementos em um Array Atendem a um Critério
 challengeType: 1
 forumTopicId: 301312
 dashedName: use-the-every-method-to-check-that-every-element-in-an-array-meets-a-criteria
@@ -8,9 +8,9 @@ dashedName: use-the-every-method-to-check-that-every-element-in-an-array-meets-a
 
 # --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.
+O método `every` funciona verificando se *todos* os elementos de um array passam em um teste. Ele retorna um booleano: `true` se todos os valores atendem ao critério e `false` caso contrário.
 
-For example, the following code would check if every element in the `numbers` array is less than 10:
+Por exemplo, o código a seguir verifica se todos os elementos no array `numbers` são menores que 10:
 
 ```js
 var numbers = [1, 5, 8, 0, 10, 11];
@@ -19,33 +19,33 @@ numbers.every(function(currentValue) {
 });
 ```
 
-The `every` method would return `false` here.
+O método `every` retorna `false` neste exemplo.
 
 # --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.
+Use o método `every` dentro da função `checkPositive` para checar se todos os elementos em `arr` são positivos. A função deve retornar um valor booleano.
 
 # --hints--
 
-Your code should use the `every` method.
+Você deve usar o método `every`.
 
 ```js
 assert(code.match(/\.every/g));
 ```
 
-`checkPositive([1, 2, 3, -4, 5])` should return `false`.
+`checkPositive([1, 2, 3, -4, 5])` deve retornar `false`.
 
 ```js
 assert.isFalse(checkPositive([1, 2, 3, -4, 5]));
 ```
 
-`checkPositive([1, 2, 3, 4, 5])` should return `true`.
+`checkPositive([1, 2, 3, 4, 5])` deve retornar `true`.
 
 ```js
 assert.isTrue(checkPositive([1, 2, 3, 4, 5]));
 ```
 
-`checkPositive([1, -2, 3, -4, 5])` should return `false`.
+`checkPositive([1, -2, 3, -4, 5])` deve retornar `false`.
 
 ```js
 assert.isFalse(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
index 8a0945dcc9..30ffcfbb95 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8f367417b2b2512b63
-title: Use the filter Method to Extract Data from an Array
+title: Use o Método filter para Extrair Dados de um Array
 challengeType: 1
 forumTopicId: 18179
 dashedName: use-the-filter-method-to-extract-data-from-an-array
@@ -8,13 +8,13 @@ dashedName: use-the-filter-method-to-extract-data-from-an-array
 
 # --description--
 
-Another useful array function is `Array.prototype.filter()`, or simply `filter()`.
+Outra função útil de array é `Array.prototype.filter()`, ou simplesmente `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.
+O `filter` chama uma função para cada elemento de um array e constrói um novo array contendo apenas os elementos para os quais a função retorna `true`. Em outras palavras, ele filtra o array de acordo com a função passada a ele. Ele o faz sem alterar o array original assim como `map`.
 
-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.
+A função callback toma três argumentos. O primeiro argumento é o elemento que está a ser processado. O segundo é o índice deste elemento e o terceiro é o array do qual `filter` foi chamado.
 
-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.
+Abaixo você vê um exemplo do `filter` sendo usado do array `users` para retornar um novo array apenas com os usuários cuja idade é menor que 30. O exemplo usa apenas o primeiro argumento do callback por simplicidade.
 
 ```js
 const users = [
@@ -27,15 +27,15 @@ 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 } ]`.
+O console mostraria o valor `[ { 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.
+A variável `watchList` armazena um array de objetos com informações de diversos filmes. Use uma combinação de `filter` e `map` em `watchList` para criar um novo array de objetos apenas com as chaves `title` e `rating`. O novo array deve incluir apenas os objetos cujo `imdbRating` é maior que ou igual a 8. Observe que os valores de `rating` são salvos como strings nos objetos, então você pode precisar convertê-los para números antes de realizar operações matemáticas com eles.
 
 # --hints--
 
-The `watchList` variable should not change.
+A variável `watchList` não deve ser alterada.
 
 ```js
 assert(
@@ -43,19 +43,19 @@ assert(
 );
 ```
 
-Your code should use the `filter` method.
+Você deve usar o método `filter`.
 
 ```js
 assert(code.match(/\s*\.\s*filter/g));
 ```
 
-Your code should not use a `for` loop.
+Você não deve usar loops `for`.
 
 ```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"}]`.
+`filteredList` deve ser igual a `[{"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, [
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
index 2a5baec172..a1f9c101cc 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7b8f367417b2b2512b61
-title: Use the map Method to Extract Data from an Array
+title: Use o Método map para Extrair Dados de um Array
 challengeType: 1
 forumTopicId: 18214
 dashedName: use-the-map-method-to-extract-data-from-an-array
@@ -8,19 +8,19 @@ 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.
+Até então nós aprendemos a usar funções puras para evitar efeitos colaterais em um programa. Vimos também que há valor em fazer funções dependerem apenas de suas entradas.
 
-This is only the beginning. As its name suggests, functional programming is centered around a theory of functions.
+Este é apenas o começo. Como o nome sugere, programação funcional orbita uma teoria de funções.
 
-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.
+Faz sentido conseguir passar funções como argumento a outras funções e retorná-las de outras funções. Funções são consideradas <dfn>objetos de primeira classe</dfn> em JavaScript e podem ser usadas como qualquer outro objeto. Elas podem ser salvas em variáveis, objetos ou passadas como argumento a funções.
 
-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`.
+Vamos começar com algumas funções simples de array. Alguns métodos no protótipo de objetos array. Neste exercício estamos de olho em `Array.prototype.map()`, ou simplesmente `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.
+O método `map` percorre cada item de um array e retorna um novo array cujos elementos são os resultados da chamada do callback para cada item. Isso tudo acontece sem modificar o array original.
 
-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.
+A função callback é chamada com três argumentos. O primeiro argumento é o elemento que está a ser processado. O segundo é o índice deste elemento e o terceiro é o array do qual `map` foi chamado.
 
-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.
+Abaixo você vê um exemplo do `map` sendo usado do array `users` para retornar um novo array apenas com os nomes dos usuários. O exemplo usa apenas o primeiro argumento do callback por simplicidade.
 
 ```js
 const users = [
@@ -33,15 +33,15 @@ const names = users.map(user => user.name);
 console.log(names);
 ```
 
-The console would display the value `[ 'John', 'Amy', 'camperCat' ]`.
+O console mostraria o valor `[ '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 to the `ratings` variable. Each movie in the new array should have only a `title` key with the name of the film, and a `rating` key with the IMDB rating. The code in the editor currently uses a `for` loop to do this, so you should replace the loop functionality with your `map` expression.
+A variável `watchList` armazena um array de objetos com informações de diversos filmes. Use o `map` na `watchList` para atribuir uma nova matriz de objetos à variável</code>ratins`. Cada filme no novo array deve ter apenas um <code>title` com o nome do filme, e uma chave `rating` com a classificação do IMDB. O código atual no editor usa um loop `for` para fazer isso, então você deve substituir o laço com sua expressão `map`.
 
 # --hints--
 
-The `watchList` variable should not change.
+A variável `watchList` não deve ser alterada.
 
 ```js
 assert(
@@ -49,19 +49,19 @@ assert(
 );
 ```
 
-Your code should not use a `for` loop.
+Você não deve usar loops `for`.
 
 ```js
 assert(!code.match(/for\s*?\([\s\S]*?\)/));
 ```
 
-Your code should use the `map` method.
+Você deve usar o método `map`.
 
 ```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"}]`.
+`ratings` deve ser igual a `[{"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, [
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
index eb237053ec..50dde13af4 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7da9367417b2b2512b68
-title: Use the reduce Method to Analyze Data
+title: Use o Método reduce para Analisar Dados
 challengeType: 1
 forumTopicId: 301313
 dashedName: use-the-reduce-method-to-analyze-data
@@ -8,15 +8,15 @@ 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.
+`Array.prototype.reduce()`, ou simplesmente `reduce()`, realiza as operações mais gerais de todas as operações de array em JavaScript. Você pode resolver quase qualquer problema de processamento de array usando o método `reduce`.
 
-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.
+O método `reduce` permite formas mais gerais de processamento de array, e é possível mostrar que tanto o `filter` quanto o `map` podem ser derivados como aplicações especiais de `reduce`. O método `reduce` percorre cada elemento de um array e retorna um valor (uma string, um número, um objeto ou array). Isso é factível através de um callback que é chamado para cada elemento.
 
-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.
+A função callback toma quatro argumentos. O primeiro argumento é conhecido como o acumulador, ao qual é atribuído o resultado do callback na iteração anterior. O segundo é o elemento a ser processado. O terceiro é o índice do elemento e o quarto é o array do qual `reduce` foi chamado.
 
-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.
+Além da função callback, `reduce` tem um parâmetro adicional que recebe um valor inicial para o acumulador. Se o segundo parâmetro não for usado, então a primeira iteração é ignorada e ao acumulador é atribuído o primeiro elemento do array na segunda iteração.
 
-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.
+Veja abaixo um exemplo usando `reduce` no array `users` para retornar a soma de todas as idades de todos os usuários. O exemplo usa apenas os dois primeiros argumentos pela simplicidade.
 
 ```js
 const users = [
@@ -29,9 +29,9 @@ const sumOfAges = users.reduce((sum, user) => sum + user.age, 0);
 console.log(sumOfAges);
 ```
 
-The console would display the value `64`.
+O console mostra o valor `64`.
 
-In another example, see how an object can be returned containing the names of the users as properties with their ages as values.
+No próximo exemplo abaixo, veja como um objeto pode ser retornado contendo os nomes dos usuários como chaves e suas idades como valores.
 
 ```js
 const users = [
@@ -47,15 +47,15 @@ const usersObj = users.reduce((obj, user) => {
 console.log(usersObj);
 ```
 
-The console would display the value `{ John: 34, Amy: 20, camperCat: 10 }`.
+O console mostra o valor `{ 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.
+A variável `watchList` armazena um array de objetos com informações de diversos filmes. Use `reduce` para encontrar a média da classificação IMDB dos filmes direcionados por `Christopher Nolan`. Você já aprendeu em desafios passados como filtrar e mapear dados de array com `filter` e `map`. Você pode precisar usar outras variáveis para retornar a nota média da função `getRating`. Observe que os valores das notas estão salvas como strings nos objetos e precisam ser convertidos para números antes que possam ser usados em operações matemáticas.
 
 # --hints--
 
-The `watchList` variable should not change.
+A variável `watchList` não deve ser alterada.
 
 ```js
 assert(
@@ -63,25 +63,25 @@ assert(
 );
 ```
 
-Your code should use the `reduce` method.
+Você deve usar o método `reduce`.
 
 ```js
 assert(code.match(/\.reduce/g));
 ```
 
-The `getRating(watchList)` should equal 8.675.
+`getRating(watchList)` deve ser igual a 8.675.
 
 ```js
 assert(getRating(watchList) === 8.675);
 ```
 
-Your code should not use a `for` loop.
+Você não deve usar loops `for`.
 
 ```js
 assert(!code.match(/for\s*?\([\s\S]*?\)/g));
 ```
 
-Your code should return the correct output after modifying the `watchList` object.
+Sua função deve retornar o valor correto após manipular `watchList` com filter, map e reduce.
 
 ```js
 assert(getRating(watchList.filter((_, i) => i < 1 || i > 2)) === 8.55);
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
index 50654a12a3..b1b51a8a2f 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dab367417b2b2512b6f
-title: Use the some Method to Check that Any Elements in an Array Meet a Criteria
+title: Use o Método some para Checar Se Pelo Menos Um Elemento em um Array Atende a um Critério
 challengeType: 1
 forumTopicId: 301314
 dashedName: use-the-some-method-to-check-that-any-elements-in-an-array-meet-a-criteria
@@ -8,9 +8,9 @@ dashedName: use-the-some-method-to-check-that-any-elements-in-an-array-meet-a-cr
 
 # --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.
+O método `some` funciona verificando se *pelo menos um* dos elementos de um array passam em um teste. Ele retorna um booleano: `true` se pelo menos um valor atende ao critério e `false` caso contrário.
 
-For example, the following code would check if any element in the `numbers` array is less than 10:
+Por exemplo, o código a seguir verifica se qualquer elemento no array `numbers` é menor que 10:
 
 ```js
 var numbers = [10, 50, 8, 220, 110, 11];
@@ -19,33 +19,33 @@ numbers.some(function(currentValue) {
 });
 ```
 
-The `some` method would return `true`.
+O método `some` retorna `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.
+Use o método `some` na função `checkPositive` para verificar se algum elemento em `arr` é positivo. A função deve retornar um valor booleano.
 
 # --hints--
 
-Your code should use the `some` method.
+Você deve usar o método `some`.
 
 ```js
 assert(code.match(/\.some/g));
 ```
 
-`checkPositive([1, 2, 3, -4, 5])` should return `true`.
+`checkPositive([1, 2, 3, -4, 5])` deve retornar `true`.
 
 ```js
 assert(checkPositive([1, 2, 3, -4, 5]));
 ```
 
-`checkPositive([1, 2, 3, 4, 5])` should return `true`.
+`checkPositive([1, 2, 3, 4, 5])` deve retornar `true`.
 
 ```js
 assert(checkPositive([1, 2, 3, 4, 5]));
 ```
 
-`checkPositive([-1, -2, -3, -4, -5])` should return `false`.
+`checkPositive([-1, -2, -3, -4, -5])` deve retornar `false`.
 
 ```js
 assert(!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
index b1aaabd91e..02a61be5f7 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a97fd23d9b809dac9921074f
-title: Arguments Optional
+title: Argumentos Opcionais
 challengeType: 5
 forumTopicId: 14271
 dashedName: arguments-optional
@@ -8,53 +8,53 @@ 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.
+Crie uma função que some dois argumentos juntos. Se apenas um argumento for fornecido, então retorne uma função que espera um argumento e retorna a sua soma.
 
-For example, `addTogether(2, 3)` should return `5`, and `addTogether(2)` should return a function.
+Por exemplo, `addTogether(2, 3)` deve retornar `5` e `addTogether(2)` deve retornar uma função.
 
-Calling this returned function with a single argument will then return the sum:
+Chamando essa função retornada com um argumento retornará a soma:
 
 ```js
 var sumTwoAnd = addTogether(2);
 ```
 
-`sumTwoAnd(3)` returns `5`.
+`sumTwoAnd(3)` retorna `5`.
 
-If either argument isn't a valid number, return undefined.
+Se algum argumento não for um número válido, retorne undefined.
 
 # --hints--
 
-`addTogether(2, 3)` should return 5.
+`addTogether(2, 3)` deve retornar 5.
 
 ```js
 assert.deepEqual(addTogether(2, 3), 5);
 ```
 
-`addTogether(23, 30)` should return 53.
+`addTogether(23, 30)` deve retornar 53.
 
 ```js
 assert.deepEqual(addTogether(23, 30), 53);
 ```
 
-`addTogether(5)(7)` should return 12.
+`addTogether(5)(7)` deve retornar 12.
 
 ```js
 assert.deepEqual(addTogether(5)(7), 12);
 ```
 
-`addTogether("http://bit.ly/IqT6zt")` should return `undefined`.
+`addTogether("http://bit.ly/IqT6zt")` deve retornar `undefined`.
 
 ```js
 assert.isUndefined(addTogether('http://bit.ly/IqT6zt'));
 ```
 
-`addTogether(2, "3")` should return `undefined`.
+`addTogether(2, "3")` deve retornar `undefined`.
 
 ```js
 assert.isUndefined(addTogether(2, '3'));
 ```
 
-`addTogether(2)([3])` should return `undefined`.
+`addTogether(2)([3])` deve retornar `undefined`.
 
 ```js
 assert.isUndefined(addTogether(2)([3]));
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
index 66194f80d7..edbeecc262 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a8d97bd4c764e91f9d2bda01
-title: Binary Agents
+title: Agentes Binários
 challengeType: 5
 forumTopicId: 14273
 dashedName: binary-agents
@@ -8,13 +8,13 @@ dashedName: binary-agents
 
 # --description--
 
-Return an English translated sentence of the passed binary string.
+Retorne uma frase traduzida em Inglês da string binária passada.
 
-The binary string will be space separated.
+A string binária será separada por espaço.
 
 # --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!?`
+`binaryAgent("01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111")` deve retornar a string `Aren't bonfires fun!?`
 
 ```js
 assert.deepEqual(
@@ -25,7 +25,7 @@ assert.deepEqual(
 );
 ```
 
-`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!`
+`binaryAgent("01001001 00100000 01101100 01101111 01110110 01100101 00100000 01000110 01110010 01100101 01100101 01000011 01101111 01100100 01100101 01000011 01100001 01101101 01110000 00100001")` deve retornar a string `I love FreeCodeCamp!`
 
 ```js
 assert.deepEqual(
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
index 5401c28249..fdb730de20 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a6b0bb188d873cb2c8729495
-title: Convert HTML Entities
+title: Converter Entidades HTML
 challengeType: 5
 forumTopicId: 16007
 dashedName: convert-html-entities
@@ -8,17 +8,17 @@ dashedName: convert-html-entities
 
 # --description--
 
-Convert the characters `&`, `<`, `>`, `"` (double quote), and `'` (apostrophe), in a string to their corresponding HTML entities.
+Converta os caracteres `&`, `<`, `>`, `"` (aspas duplas) e `'` (aspas simples), em uma string para suas entidades HTML correspondentes.
 
 # --hints--
 
-`convertHTML("Dolce & Gabbana")` should return the string `Dolce &amp; Gabbana`.
+`convertHTML("Dolce & Gabbana")` deve retorna a 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`.
+`convertHTML("Hamburgers < Pizza < Tacos")` deve retornar a string `Hamburgers &lt; Pizza &lt; Tacos`.
 
 ```js
 assert.match(
@@ -27,13 +27,13 @@ assert.match(
 );
 ```
 
-`convertHTML("Sixty > twelve")` should return the string `Sixty &gt; twelve`.
+`convertHTML("Sixty > twelve")` deve retornar a 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;`.
+`convertHTML('Stuff in "quotation marks"')` deve retornar a string `Stuff in &quot;quotation marks&quot;`.
 
 ```js
 assert.match(
@@ -42,19 +42,19 @@ assert.match(
 );
 ```
 
-`convertHTML("Schindler's List")` should return the string `Schindler&apos;s List`.
+`convertHTML("Schindler's List")` deve retornar a string `Schindler&apos;s List`.
 
 ```js
 assert.match(convertHTML("Schindler's List"), /Schindler&apos;s List/);
 ```
 
-`convertHTML("<>")` should return the string `&lt;&gt;`.
+`convertHTML("<>")` deve retornar a string `&lt;&gt;`.
 
 ```js
 assert.match(convertHTML('<>'), /&lt;&gt;/);
 ```
 
-`convertHTML("abc")` should return the string `abc`.
+`convertHTML("abc")` deve retornar a string `abc`.
 
 ```js
 assert.strictEqual(convertHTML('abc'), 'abc');
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
index 8ec9a4a02e..194a9dc24c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a5de63ebea8dbee56860f4f2
-title: Diff Two Arrays
+title: Diferenciar Dois Arrays
 challengeType: 5
 forumTopicId: 16008
 dashedName: diff-two-arrays
@@ -8,19 +8,19 @@ 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.
+Compare dois arrays e retorne um novo array com qualquer item encontrado em apenas um dos dois arrays passados, mas não ambos. Em outras palavras, retorne a diferença simétrica de dois arrays.
 
-**Note:** You can return the array with its elements in any order.
+**Nota:** Você pode retornar o array com seus elementos em qualquer ordem.
 
 # --hints--
 
-`diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5])` should return an array.
+`diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5])` deve retornar um 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"]`.
+`["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` deve retornar `["pink wool"]`.
 
 ```js
 assert.sameMembers(
@@ -32,7 +32,7 @@ assert.sameMembers(
 );
 ```
 
-`["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` should return an array with one item.
+`["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` deve retornar um array com um item.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-`["andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` should return `["diorite", "pink wool"]`.
+`["andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` deve retornar `["diorite", "pink wool"]`.
 
 ```js
 assert.sameMembers(
@@ -55,7 +55,7 @@ assert.sameMembers(
 );
 ```
 
-`["andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` should return an array with two items.
+`["andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` deve retornar um array com dois itens.
 
 ```js
 assert(
@@ -66,7 +66,7 @@ assert(
 );
 ```
 
-`["andesite", "grass", "dirt", "dead shrub"], ["andesite", "grass", "dirt", "dead shrub"]` should return `[]`.
+`["andesite", "grass", "dirt", "dead shrub"], ["andesite", "grass", "dirt", "dead shrub"]` deve retornar `[]`.
 
 ```js
 assert.sameMembers(
@@ -78,7 +78,7 @@ assert.sameMembers(
 );
 ```
 
-`["andesite", "grass", "dirt", "dead shrub"], ["andesite", "grass", "dirt", "dead shrub"]` should return an empty array.
+`["andesite", "grass", "dirt", "dead shrub"], ["andesite", "grass", "dirt", "dead shrub"]` deve retornar um array vazio.
 
 ```js
 assert(
@@ -89,19 +89,19 @@ assert(
 );
 ```
 
-`[1, 2, 3, 5], [1, 2, 3, 4, 5]` should return `[4]`.
+`[1, 2, 3, 5], [1, 2, 3, 4, 5]` deve retornar `[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.
+`[1, 2, 3, 5], [1, 2, 3, 4, 5]` deve retornar um array com um 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]`.
+`[1, "calf", 3, "piglet"], [1, "calf", 3, 4]` deve retornar `["piglet", 4]`.
 
 ```js
 assert.sameMembers(diffArray([1, 'calf', 3, 'piglet'], [1, 'calf', 3, 4]), [
@@ -110,13 +110,13 @@ assert.sameMembers(diffArray([1, 'calf', 3, 'piglet'], [1, 'calf', 3, 4]), [
 ]);
 ```
 
-`[1, "calf", 3, "piglet"], [1, "calf", 3, 4]` should return an array with two items.
+`[1, "calf", 3, "piglet"], [1, "calf", 3, 4]` deve retornar um array com dois itens.
 
 ```js
 assert(diffArray([1, 'calf', 3, 'piglet'], [1, 'calf', 3, 4]).length === 2);
 ```
 
-`[], ["snuffleupagus", "cookie monster", "elmo"]` should return `["snuffleupagus", "cookie monster", "elmo"]`.
+`[], ["snuffleupagus", "cookie monster", "elmo"]` deve retornar `["snuffleupagus", "cookie monster", "elmo"]`.
 
 ```js
 assert.sameMembers(diffArray([], ['snuffleupagus', 'cookie monster', 'elmo']), [
@@ -126,13 +126,13 @@ assert.sameMembers(diffArray([], ['snuffleupagus', 'cookie monster', 'elmo']), [
 ]);
 ```
 
-`[], ["snuffleupagus", "cookie monster", "elmo"]` should return an array with three items.
+`[], ["snuffleupagus", "cookie monster", "elmo"]` deve retornar um array com três itens.
 
 ```js
 assert(diffArray([], ['snuffleupagus', 'cookie monster', 'elmo']).length === 3);
 ```
 
-`[1, "calf", 3, "piglet"], [7, "filly"]` should return `[1, "calf", 3, "piglet", 7, "filly"]`.
+`[1, "calf", 3, "piglet"], [7, "filly"]` deve retornar `[1, "calf", 3, "piglet", 7, "filly"]`.
 
 ```js
 assert.sameMembers(diffArray([1, 'calf', 3, 'piglet'], [7, 'filly']), [
@@ -145,7 +145,7 @@ assert.sameMembers(diffArray([1, 'calf', 3, 'piglet'], [7, 'filly']), [
 ]);
 ```
 
-`[1, "calf", 3, "piglet"], [7, "filly"]` should return an array with six items.
+`[1, "calf", 3, "piglet"], [7, "filly"]` deve retornar um array com seis itens.
 
 ```js
 assert(diffArray([1, 'calf', 3, 'piglet'], [7, 'filly']).length === 6);
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
index 820dc6ac3e..ec69358174 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: afd15382cdfb22c9efe8b7de
-title: DNA Pairing
+title: Pareamento de DNA
 challengeType: 5
 forumTopicId: 16009
 dashedName: dna-pairing
@@ -8,19 +8,19 @@ 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.
+A faixa de DNA está faltando o elemento de pareamento. Pegue cada caractere, pegue seu par e retorne os resultados como um array de duas dimensões.
 
-[Base pairs](http://en.wikipedia.org/wiki/Base_pair) are a pair of AT and CG. Match the missing element to the provided character.
+[Pares de base](http://en.wikipedia.org/wiki/Base_pair) são pares de AT e CG. Associe o elemento faltando para o caractere fornecido.
 
-Return the provided character as the first element in each array.
+Retorne o caractere fornecido como o primeiro elemento em cada array.
 
-For example, for the input `GCG`, return `[["G", "C"], ["C","G"], ["G", "C"]]`
+Por exemplo, para a entrada `GCG`, retorne `[["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.
+O caractere e seu par estão emparelhados em um array, e todos os arrays estão agrupados em um array encapsulador.
 
 # --hints--
 
-`pairElement("ATCGA")` should return `[["A","T"],["T","A"],["C","G"],["G","C"],["A","T"]]`.
+`pairElement("ATCGA")` deve retornar `[["A","T"],["T","A"],["C","G"],["G","C"],["A","T"]]`.
 
 ```js
 assert.deepEqual(pairElement('ATCGA'), [
@@ -32,7 +32,7 @@ assert.deepEqual(pairElement('ATCGA'), [
 ]);
 ```
 
-`pairElement("TTGAG")` should return `[["T","A"],["T","A"],["G","C"],["A","T"],["G","C"]]`.
+`pairElement("TTGAG")` deve retornar `[["T","A"],["T","A"],["G","C"],["A","T"],["G","C"]]`.
 
 ```js
 assert.deepEqual(pairElement('TTGAG'), [
@@ -44,7 +44,7 @@ assert.deepEqual(pairElement('TTGAG'), [
 ]);
 ```
 
-`pairElement("CTCTA")` should return `[["C","G"],["T","A"],["C","G"],["T","A"],["A","T"]]`.
+`pairElement("CTCTA")` deve retornar `[["C","G"],["T","A"],["C","G"],["T","A"],["A","T"]]`.
 
 ```js
 assert.deepEqual(pairElement('CTCTA'), [
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
index b2d97fca2f..1546456078 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a5deed1811a43193f9f1c841
-title: Drop it
+title: Solte isso
 challengeType: 5
 forumTopicId: 16010
 dashedName: drop-it
@@ -8,13 +8,13 @@ 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.
+Dado o array `arr`, faça iterações sobre ele e remova cada elemento começando do primeiro elemento (o índice 0) até que a função `func` retorne `true` quando o elemento iterado for passado através dele.
 
-Then return the rest of the array once the condition is satisfied, otherwise, `arr` should be returned as an empty array.
+Em seguida, retorne o resto do array uma vez que a condição for satisfeita, caso contrário, `arr` deve ser retornado como um array vazio.
 
 # --hints--
 
-`dropElements([1, 2, 3, 4], function(n) {return n >= 3;})` should return `[3, 4]`.
+`dropElements([1, 2, 3, 4], function(n) {return n >= 3;})` deve retornar `[3, 4]`.
 
 ```js
 assert.deepEqual(
@@ -25,7 +25,7 @@ assert.deepEqual(
 );
 ```
 
-`dropElements([0, 1, 0, 1], function(n) {return n === 1;})` should return `[1, 0, 1]`.
+`dropElements([0, 1, 0, 1], function(n) {return n === 1;})` deve retornar `[1, 0, 1]`.
 
 ```js
 assert.deepEqual(
@@ -36,7 +36,7 @@ assert.deepEqual(
 );
 ```
 
-`dropElements([1, 2, 3], function(n) {return n > 0;})` should return `[1, 2, 3]`.
+`dropElements([1, 2, 3], function(n) {return n > 0;})` deve retornar `[1, 2, 3]`.
 
 ```js
 assert.deepEqual(
@@ -47,7 +47,7 @@ assert.deepEqual(
 );
 ```
 
-`dropElements([1, 2, 3, 4], function(n) {return n > 5;})` should return `[]`.
+`dropElements([1, 2, 3, 4], function(n) {return n > 5;})` deve retornar `[]`.
 
 ```js
 assert.deepEqual(
@@ -58,7 +58,7 @@ assert.deepEqual(
 );
 ```
 
-`dropElements([1, 2, 3, 7, 4], function(n) {return n > 3;})` should return `[7, 4]`.
+`dropElements([1, 2, 3, 7, 4], function(n) {return n > 3;})` deve retornar `[7, 4]`.
 
 ```js
 assert.deepEqual(
@@ -69,7 +69,7 @@ assert.deepEqual(
 );
 ```
 
-`dropElements([1, 2, 3, 9, 2], function(n) {return n > 2;})` should return `[3, 9, 2]`.
+`dropElements([1, 2, 3, 9, 2], function(n) {return n > 2;})` deve retornar `[3, 9, 2]`.
 
 ```js
 assert.deepEqual(
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
index 0237b81875..2d23d530e3 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a10d2431ad0c6a099a4b8b52
-title: Everything Be True
+title: Tudo Seja Verdadeiro
 challengeType: 5
 forumTopicId: 16011
 dashedName: everything-be-true
@@ -8,17 +8,17 @@ dashedName: everything-be-true
 
 # --description--
 
-Check if the predicate (second argument) is <dfn>truthy</dfn> on all elements of a collection (first argument).
+Verifique se o predicado (segundo argumento) é <dfn>truthy</dfn> em todos os elementos de uma coleção (primeiro argumento).
 
-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`.
+Em outras palavras, você recebe uma coleção de array de objetos. O predicado `pre` será uma propriedade de objeto e você precisa retornar `true` se seu valor for `truthy`. Caso contrário, retorne `false`.
 
-In JavaScript, `truthy` values are values that translate to `true` when evaluated in a Boolean context.
+Em JavaScript, valores </code>truthy` são valores que traduzem para <code>true` quando avaliados em um contexto booleano.
 
-Remember, you can access object properties through either dot notation or `[]` notation.
+Lembre-se, você pode acessar propriedades de objeto através de notação de ponto ou notação `[]`.
 
 # --hints--
 
-`truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy", "sex": "male"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex")` should return `true`.
+`truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy", "sex": "male"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex")` deve retornar `true`.
 
 ```js
 assert.strictEqual(
@@ -35,7 +35,7 @@ assert.strictEqual(
 );
 ```
 
-`truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex")` should return `false`.
+`truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex")` deve retornar `false`.
 
 ```js
 assert.strictEqual(
@@ -52,7 +52,7 @@ assert.strictEqual(
 );
 ```
 
-`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`.
+`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")` deve retornar `false`.
 
 ```js
 assert.strictEqual(
@@ -69,7 +69,7 @@ assert.strictEqual(
 );
 ```
 
-`truthCheck([{"name": "Pete", "onBoat": true}, {"name": "Repeat", "onBoat": true}, {"name": "FastForward", "onBoat": null}], "onBoat")` should return `false`.
+`truthCheck([{"name": "Pete", "onBoat": true}, {"name": "Repeat", "onBoat": true}, {"name": "FastForward", "onBoat": null}], "onBoat")` deve retornar `false`.
 
 ```js
 assert.strictEqual(
@@ -85,7 +85,7 @@ assert.strictEqual(
 );
 ```
 
-`truthCheck([{"name": "Pete", "onBoat": true}, {"name": "Repeat", "onBoat": true, "alias": "Repete"}, {"name": "FastForward", "onBoat": true}], "onBoat")` should return `true`.
+`truthCheck([{"name": "Pete", "onBoat": true}, {"name": "Repeat", "onBoat": true, "alias": "Repete"}, {"name": "FastForward", "onBoat": true}], "onBoat")` deve retornar `true`.
 
 ```js
 assert.strictEqual(
@@ -101,13 +101,13 @@ assert.strictEqual(
 );
 ```
 
-`truthCheck([{"single": "yes"}], "single")` should return `true`.
+`truthCheck([{"single": "yes"}], "single")` deve retornar `true`.
 
 ```js
 assert.strictEqual(truthCheck([{ single: 'yes' }], 'single'), true);
 ```
 
-`truthCheck([{"single": ""}, {"single": "double"}], "single")` should return `false`.
+`truthCheck([{"single": ""}, {"single": "double"}], "single")` deve retornar `false`.
 
 ```js
 assert.strictEqual(
@@ -116,7 +116,7 @@ assert.strictEqual(
 );
 ```
 
-`truthCheck([{"single": "double"}, {"single": undefined}], "single")` should return `false`.
+`truthCheck([{"single": "double"}, {"single": undefined}], "single")` deve retornar `false`.
 
 ```js
 assert.strictEqual(
@@ -125,7 +125,7 @@ assert.strictEqual(
 );
 ```
 
-`truthCheck([{"single": "double"}, {"single": NaN}], "single")` should return `false`.
+`truthCheck([{"single": "double"}, {"single": NaN}], "single")` deve retornar `false`.
 
 ```js
 assert.strictEqual(
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
index a01f7a9f92..6ff193ea57 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a2f1d72d9b908d0bd72bb9f6
-title: Make a Person
+title: Faça uma Pessoa
 challengeType: 5
 forumTopicId: 16020
 dashedName: make-a-person
@@ -8,7 +8,7 @@ dashedName: make-a-person
 
 # --description--
 
-Fill in the object constructor with the following methods below:
+Preencha o construtor do objeto com os seguintes métodos abaixo:
 
 ```js
 getFirstName()
@@ -19,53 +19,53 @@ 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.
+Execute os testes para ver a saída esperada para cada método. Os métodos que recebem um argumento têm de aceitar apenas um argumento e tem de ser uma string. Estes métodos devem constituir o único meio de interação com o objeto.
 
 # --hints--
 
-`Object.keys(bob).length` should return 6.
+`Object.keys(bob).length` deve retornar 6.
 
 ```js
 assert.deepEqual(Object.keys(bob).length, 6);
 ```
 
-`bob instanceof Person` should return `true`.
+`bob instanceof Pessoa` deve retornar `true`.
 
 ```js
 assert.deepEqual(bob instanceof Person, true);
 ```
 
-`bob.firstName` should return `undefined`.
+`bob.firstName` deve retornar `undefined`.
 
 ```js
 assert.deepEqual(bob.firstName, undefined);
 ```
 
-`bob.lastName` should return `undefined`.
+`bob.lastName` deve retornar `undefined`.
 
 ```js
 assert.deepEqual(bob.lastName, undefined);
 ```
 
-`bob.getFirstName()` should return the string `Bob`.
+`bob.getFirstName()` deve retornar a string `Bob`.
 
 ```js
 assert.deepEqual(bob.getFirstName(), 'Bob');
 ```
 
-`bob.getLastName()` should return the string `Ross`.
+`bob.getLastName()` deve retornar a string `Ross`.
 
 ```js
 assert.deepEqual(bob.getLastName(), 'Ross');
 ```
 
-`bob.getFullName()` should return the string `Bob Ross`.
+`bob.getFullName()` deve retornar a string `Bob Ross`.
 
 ```js
 assert.deepEqual(bob.getFullName(), 'Bob Ross');
 ```
 
-`bob.getFullName()` should return the string `Haskell Ross` after `bob.setFirstName("Haskell")`.
+`bob.getFullName()` deve retornar a string `Haskell Ross` após `bob.setFirstName("Haskell")`.
 
 ```js
 assert.strictEqual(
@@ -77,7 +77,7 @@ assert.strictEqual(
 );
 ```
 
-`bob.getFullName()` should return the string `Haskell Curry` after `bob.setLastName("Curry")`.
+`bob.getFullName()` deve retornar a string `Haskell Curry` após `bob.setLastName("Curry")`.
 
 ```js
 assert.strictEqual(
@@ -90,7 +90,7 @@ assert.strictEqual(
 );
 ```
 
-`bob.getFullName()` should return the string `Haskell Curry` after `bob.setFullName("Haskell Curry")`.
+`bob.getFullName()` deve retornar a string `Haskell Curry` após `bob.setFullName("Haskell Curry")`.
 
 ```js
 assert.strictEqual(
@@ -102,7 +102,7 @@ assert.strictEqual(
 );
 ```
 
-`bob.getFirstName()` should return the string `Haskell` after `bob.setFullName("Haskell Curry")`.
+`bob.getFirstName()` deve retornar a string `Haskell` após `bob.setFullName("Haskell Curry")`.
 
 ```js
 assert.strictEqual(
@@ -114,7 +114,7 @@ assert.strictEqual(
 );
 ```
 
-`bob.getLastName()` should return the string `Curry` after `bob.setFullName("Haskell Curry")`.
+`bob.getLastName()` deve retornar a string `Curry` após `bob.setFullName("Haskell Curry")`.
 
 ```js
 assert.strictEqual(
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
index 74118356a4..8ccdf3d525 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: af4afb223120f7348cdfc9fd
-title: Map the Debris
+title: Mapear o Debris
 challengeType: 5
 forumTopicId: 16021
 dashedName: map-the-debris
@@ -8,19 +8,19 @@ dashedName: map-the-debris
 
 # --description--
 
-Return a new array that transforms the elements' average altitude into their orbital periods (in seconds).
+Retorna um novo array que transforma a altitude média dos elementos em seus períodos órbita (em segundos).
 
-The array will contain objects in the format `{name: 'name', avgAlt: avgAlt}`.
+O array conterá objetos no formato `{name: 'name', avgAlt: avgAlt}`.
 
-You can read about orbital periods [on Wikipedia](http://en.wikipedia.org/wiki/Orbital_period).
+Você pode ler sobre períodos de órbita [na Wikipedia](http://en.wikipedia.org/wiki/Orbital_period).
 
-The values should be rounded to the nearest whole number. The body being orbited is Earth.
+Os valores devem estar arredondados para o número inteiro mais próximo. O corpo sendo orbitado é a Terra.
 
-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>.
+O raio da terra é 6367,4447 quilômetros, e o valor de GM da térra é 398600,4418 km<sup>3</sup>s<sup>-2</sup>.
 
 # --hints--
 
-`orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}])` should return `[{name: "sputnik", orbitalPeriod: 86400}]`.
+`orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}])` deve retornar `[{name: "sputnik", orbitalPeriod: 86400}]`.
 
 ```js
 assert.deepEqual(orbitalPeriod([{ name: 'sputnik', avgAlt: 35873.5553 }]), [
@@ -28,7 +28,7 @@ assert.deepEqual(orbitalPeriod([{ name: 'sputnik', avgAlt: 35873.5553 }]), [
 ]);
 ```
 
-`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}]`.
+`orbitalPeriod([{name: "iss", avgAlt: 413.6}, {name: "hubble", avgAlt: 556.7}, {name: "moon", avgAlt: 378632.553}])` deve retornar `[{name : "iss", orbitalPeriod: 5557}, {name: "hubble", orbitalPeriod: 5734}, {name: "moon", orbitalPeriod: 2377399}]`.
 
 ```js
 assert.deepEqual(
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
index a1ecc67cbb..2e35fc24dd 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: af7588ade1100bde429baf20
-title: Missing letters
+title: Letras faltando
 challengeType: 5
 forumTopicId: 16023
 dashedName: missing-letters
@@ -8,37 +8,37 @@ dashedName: missing-letters
 
 # --description--
 
-Find the missing letter in the passed letter range and return it.
+Encontre a letra que falta no intervalo de letras passado e devolva-a.
 
-If all letters are present in the range, return `undefined`.
+Se todas as letras estiverem presentes no intervalo, retorne `undefined`.
 
 # --hints--
 
-`fearNotLetter("abce")` should return the string `d`.
+`fearNotLetter("abce")` deve retornar a string `d`.
 
 ```js
 assert.deepEqual(fearNotLetter('abce'), 'd');
 ```
 
-`fearNotLetter("abcdefghjklmno")` should return the string `i`.
+`fearNotLetter("abcdefghjklmno")` deve retornar a string `i`.
 
 ```js
 assert.deepEqual(fearNotLetter('abcdefghjklmno'), 'i');
 ```
 
-`fearNotLetter("stvwx")` should return the string `u`.
+`fearNotLetter("stvwx")` deve retornar a string `u`.
 
 ```js
 assert.deepEqual(fearNotLetter('stvwx'), 'u');
 ```
 
-`fearNotLetter("bcdf")` should return the string `e`.
+`fearNotLetter("bcdf")` deve retornar a string `e`.
 
 ```js
 assert.deepEqual(fearNotLetter('bcdf'), 'e');
 ```
 
-`fearNotLetter("abcdefghijklmnopqrstuvwxyz")` should return `undefined`.
+`fearNotLetter("abcdefghijklmnopqrstuvwxyz")` deve retornar `undefined`.
 
 ```js
 assert.isUndefined(fearNotLetter('abcdefghijklmnopqrstuvwxyz'));
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
index e355f395b3..f77aa077b3 100644
--- 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
@@ -8,55 +8,55 @@ dashedName: pig-latin
 
 # --description--
 
-Pig Latin is a way of altering English Words. The rules are as follows:
+Pig Latin é uma forma de alterar palavras inglesas. As regras são as seguintes:
 
-\- 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.
+\- Se uma palavra começar com uma consoante, tire a primeira consoante ou grupo de consoantes, mova-a para o final da palavra e adicione `ay` a ela.
 
-\- If a word begins with a vowel, just add `way` at the end.
+\- Se uma palavra começar com uma vogal, basta adicionar `way` no final.
 
 # --instructions--
 
-Translate the provided string to Pig Latin. Input strings are guaranteed to be English words in all lowercase.
+Traduza a string fornecida para o Pig Latin. As strings de entrada terão a garantia de serem palavras em inglês com as letras em minúsculo.
 
 # --hints--
 
-`translatePigLatin("california")` should return the string `aliforniacay`.
+`translatePigLatin("california")` deve retornar a string `aliforniacay`.
 
 ```js
 assert.deepEqual(translatePigLatin('california'), 'aliforniacay');
 ```
 
-`translatePigLatin("paragraphs")` should return the string `aragraphspay`.
+`translatePigLatin("paragraphs")` deve retornar a string `aragraphspay`.
 
 ```js
 assert.deepEqual(translatePigLatin('paragraphs'), 'aragraphspay');
 ```
 
-`translatePigLatin("glove")` should return the string `oveglay`.
+`translatePigLatin("glove")` deve retornar a string `oveglay`.
 
 ```js
 assert.deepEqual(translatePigLatin('glove'), 'oveglay');
 ```
 
-`translatePigLatin("algorithm")` should return the string `algorithmway`.
+`translatePigLatin("algorithm")` deve retornar a string `algorithmway`.
 
 ```js
 assert.deepEqual(translatePigLatin('algorithm'), 'algorithmway');
 ```
 
-`translatePigLatin("eight")` should return the string `eightway`.
+`translatePigLatin("eight")` deve retornar a 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`.
+Deve lidar com palavras onde a primeira vogal vem no meio da palavra.  `translatePigLatin("schwartz")` deve retornar a string `artzschway`.
 
 ```js
 assert.deepEqual(translatePigLatin('schwartz'), 'artzschway');
 ```
 
-Should handle words without vowels. `translatePigLatin("rhythm")` should return the string `rhythmay`.
+Deve lidar com palavras sem vogais. `translatePigLatin("rhythm")` deve retornar a string `rhythmay`.
 
 ```js
 assert.deepEqual(translatePigLatin('rhythm'), 'rhythmay');
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
index 1f9df37ac3..4f504c31f0 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a0b5010f579e69b815e7c5d6
-title: Search and Replace
+title: Procurar e substituir
 challengeType: 5
 forumTopicId: 16045
 dashedName: search-and-replace
@@ -8,19 +8,19 @@ dashedName: search-and-replace
 
 # --description--
 
-Perform a search and replace on the sentence using the arguments provided and return the new sentence.
+Realize uma busca e substitua na frase usando os argumentos fornecidos e retorne a nova frase.
 
-First argument is the sentence to perform the search and replace on.
+O primeiro argumento é a frase para realizar a busca e substituir.
 
-Second argument is the word that you will be replacing (before).
+O segundo argumento é a palavra que você substituirá (antes).
 
-Third argument is what you will be replacing the second argument with (after).
+O terceiro argumento é com o que você irá substituir o segundo argumento (depois).
 
-**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`
+**Nota:** Preserve a capitalização do primeiro caractere na palavra original quando você estiver substituindo. Por exemplo, se você quiser substituir a palavra `Book` com a palavra `dog`, deve ser substituído com `Dog`
 
 # --hints--
 
-`myReplace("Let us go to the store", "store", "mall")` should return the string `Let us go to the mall`.
+`myReplace("Let us go to the store", "store", "mall")` deve retornar a string `Let us go to the mall`.
 
 ```js
 assert.deepEqual(
@@ -29,7 +29,7 @@ assert.deepEqual(
 );
 ```
 
-`myReplace("He is Sleeping on the couch", "Sleeping", "sitting")` should return the string `He is Sitting on the couch`.
+`myReplace("He is Sleeping on the couch", "Sleeping", "sitting")` deve retornar a string `He is Sitting on the couch`.
 
 ```js
 assert.deepEqual(
@@ -38,7 +38,7 @@ assert.deepEqual(
 );
 ```
 
-`myReplace("I think we should look up there", "up", "Down")` should return the string `I think we should look down there`.
+`myReplace("I think we should look up there", "up", "Down")` deve retornar a string `I think we should look down there`.
 
 ```js
 assert.deepEqual(
@@ -47,7 +47,7 @@ assert.deepEqual(
 );
 ```
 
-`myReplace("This has a spellngi error", "spellngi", "spelling")` should return the string `This has a spelling error`.
+`myReplace("This has a spellngi error", "spellngi", "spelling")` deve retornar a string `This has a spelling error`.
 
 ```js
 assert.deepEqual(
@@ -56,7 +56,7 @@ assert.deepEqual(
 );
 ```
 
-`myReplace("His name is Tom", "Tom", "john")` should return the string `His name is John`.
+`myReplace("His name is Tom", "Tom", "john")` deve retornar a string `His name is John`.
 
 ```js
 assert.deepEqual(
@@ -65,7 +65,7 @@ assert.deepEqual(
 );
 ```
 
-`myReplace("Let us get back to more Coding", "Coding", "algorithms")` should return the string `Let us get back to more Algorithms`.
+`myReplace("Let us get back to more Coding", "Coding", "algorithms")` deve retornar a string `Let us get back to more Algorithms`.
 
 ```js
 assert.deepEqual(
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
index aa332e779e..898fa08e14 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a39963a4c10bc8b4d4f06d7e
-title: Seek and Destroy
+title: Procurar e Destruir
 challengeType: 5
 forumTopicId: 16046
 dashedName: seek-and-destroy
@@ -8,37 +8,37 @@ 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.
+Você receberá um array inicial (o primeiro argumento na função `destroyer`), seguido por um ou mais argumentos. Remova todos os elementos da matriz inicial que são do mesmo valor que esses argumentos.
 
-**Note:** You have to use the `arguments` object.
+**Nota:** Você tem que usar os `argumentos` do objeto.
 
 # --hints--
 
-`destroyer([1, 2, 3, 1, 2, 3], 2, 3)` should return `[1, 1]`.
+`destroyer([1, 2, 3, 1, 2, 3], 2, 3)` deve retornar `[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]`.
+`destroyer([1, 2, 3, 5, 1, 2, 3], 2, 3)` deve retornar `[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]`.
+`destroyer([3, 5, 1, 2, 2], 2, 3, 5)` deve retornar `[1]`.
 
 ```js
 assert.deepEqual(destroyer([3, 5, 1, 2, 2], 2, 3, 5), [1]);
 ```
 
-`destroyer([2, 3, 2, 3], 2, 3)` should return `[]`.
+`destroyer([2, 3, 2, 3], 2, 3)` deve retornar `[]`.
 
 ```js
 assert.deepEqual(destroyer([2, 3, 2, 3], 2, 3), []);
 ```
 
-`destroyer(["tree", "hamburger", 53], "tree", 53)` should return `["hamburger"]`.
+`destroyer(["tree", "hamburger", 53], "tree", 53)` deve retornar `["hamburger"]`.
 
 ```js
 assert.deepEqual(destroyer(['tree', 'hamburger', 53], 'tree', 53), [
@@ -46,7 +46,7 @@ assert.deepEqual(destroyer(['tree', 'hamburger', 53], 'tree', 53), [
 ]);
 ```
 
-`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]`.
+`destroyer(["possum", "trollo", 12, "safari", "hotdog", 92, 65, "grandma", "bugati", "trojan", "yacht"], "yacht", "possum", "trollo", "safari", "hotdog", "grandma", "bugati", "trojan")` deve retornar `[12,92,65]`.
 
 ```js
 assert.deepEqual(
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
index e6c39f5ee6..20f03ace22 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: ae9defd7acaf69703ab432ea
-title: Smallest Common Multiple
+title: Menores Múltiplos Comuns
 challengeType: 5
 forumTopicId: 16075
 dashedName: smallest-common-multiple
@@ -8,45 +8,45 @@ 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.
+Encontre o menor múltiplo comum dos parâmetros fornecidos que podem ser divididos sem resto por ambos, bem como por todos os números sequenciais no intervalo entre esses parâmetros.
 
-The range will be an array of two numbers that will not necessarily be in numerical order.
+O intervalo será um array de dois números que não estará necessariamente em ordem numérica.
 
-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.
+Por exemplo, se forem dados 1 e 3, encontre o menor múltiplo comum de 1 e 3 que também é divisível por todos os números *entre* 1 e 3. A resposta aqui seria 6.
 
 # --hints--
 
-`smallestCommons([1, 5])` should return a number.
+`smallestCommons([1, 5])` deve retornar um número.
 
 ```js
 assert.deepEqual(typeof smallestCommons([1, 5]), 'number');
 ```
 
-`smallestCommons([1, 5])` should return 60.
+`smallestCommons([1, 5])` deve retornar 60.
 
 ```js
 assert.deepEqual(smallestCommons([1, 5]), 60);
 ```
 
-`smallestCommons([5, 1])` should return 60.
+`smallestCommons([5, 1])` deve retornar 60.
 
 ```js
 assert.deepEqual(smallestCommons([5, 1]), 60);
 ```
 
-`smallestCommons([2, 10])` should return 2520.
+`smallestCommons([2, 10])` deve retornar 2520.
 
 ```js
 assert.deepEqual(smallestCommons([2, 10]), 2520);
 ```
 
-`smallestCommons([1, 13])` should return 360360.
+`smallestCommons([1, 13])` deve retornar 360360.
 
 ```js
 assert.deepEqual(smallestCommons([1, 13]), 360360);
 ```
 
-`smallestCommons([23, 18])` should return 6056820.
+`smallestCommons([23, 18])` retornará 6056820.
 
 ```js
 assert.deepEqual(smallestCommons([23, 18]), 6056820);
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
index cbc9cd794a..7609998952 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a105e963526e7de52b219be9
-title: Sorted Union
+title: União ordenada
 challengeType: 5
 forumTopicId: 16077
 dashedName: sorted-union
@@ -8,29 +8,29 @@ 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.
+Escreva uma função que recebe dois ou mais arrays e retorne um novo array de calores únicos na ordem do array original fornecido.
 
-In other words, all values present from all arrays should be included in their original order, but with no duplicates in the final array.
+Em outras palavras, todos os valores presentes de todos os arrays devem ser incluídos na sua ordem original, mas sem valores duplicados no array final.
 
-The unique numbers should be sorted by their original order, but the final array should not be sorted in numerical order.
+Os números únicos devem ser ordenados pela sua ordem original, mas o array final não deve ser ordenado em ordem numérica.
 
-Check the assertion tests for examples.
+Verifique os testes de asserção para exemplos.
 
 # --hints--
 
-`uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1])` should return `[1, 3, 2, 5, 4]`.
+`uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1])` deve retornar `[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]`.
+`uniteUnique([1, 2, 3], [5, 2, 1])` deve retornar `[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]`.
+`uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8])` deve retornar `[1, 2, 3, 5, 4, 6, 7, 8]`.
 
 ```js
 assert.deepEqual(uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8]), [
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
index 837188868b..a45bc4d380 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a103376db3ba46b2d50db289
-title: Spinal Tap Case
+title: Caso de Toque Espinal
 challengeType: 5
 forumTopicId: 16078
 dashedName: spinal-tap-case
@@ -8,23 +8,23 @@ dashedName: spinal-tap-case
 
 # --description--
 
-Convert a string to spinal case. Spinal case is all-lowercase-words-joined-by-dashes.
+Converta uma string para um caso espinal. Casos espinais são todas-as-palavras-minúsculas-unidas-por-traços.
 
 # --hints--
 
-`spinalCase("This Is Spinal Tap")` should return the string `this-is-spinal-tap`.
+`spinalCase("This Is Spinal Tap")` deve retornar a 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`.
+`spinalCase("thisIsSpinalTap")` deve retornar a 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`.
+`spinalCase("The_Andy_Griffith_Show")` deve retornar a string `the-andy-griffith-show`.
 
 ```js
 assert.strictEqual(
@@ -33,7 +33,7 @@ assert.strictEqual(
 );
 ```
 
-`spinalCase("Teletubbies say Eh-oh")` should return the string `teletubbies-say-eh-oh`.
+`spinalCase("Teletubbies say Eh-oh")` deve retornar a string `teletubbies-say-eh-oh`.
 
 ```js
 assert.strictEqual(
@@ -42,7 +42,7 @@ assert.strictEqual(
 );
 ```
 
-`spinalCase("AllThe-small Things")` should return the string `all-the-small-things`.
+`spinalCase("AllThe-small Things")` deve retornar a string `all-the-small-things`.
 
 ```js
 assert.strictEqual(spinalCase('AllThe-small Things'), 'all-the-small-things');
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
index 5744ab7e20..7faa9c0640 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: ab306dbdcc907c7ddfc30830
-title: Steamroller
+title: Rolo compressor
 challengeType: 5
 forumTopicId: 16079
 dashedName: steamroller
@@ -8,35 +8,35 @@ dashedName: steamroller
 
 # --description--
 
-Flatten a nested array. You must account for varying levels of nesting.
+Achate um array aninhado. Você deve lidar com diferentes níveis de aninhamento.
 
 # --hints--
 
-`steamrollArray([[["a"]], [["b"]]])` should return `["a", "b"]`.
+`steamrollArray([[["a"]], [["b"]]])` deve retornar `["a", "b"]`.
 
 ```js
 assert.deepEqual(steamrollArray([[['a']], [['b']]]), ['a', 'b']);
 ```
 
-`steamrollArray([1, [2], [3, [[4]]]])` should return `[1, 2, 3, 4]`.
+`steamrollArray([1, [2], [3, [[4]]]])` deve retornar `[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]`.
+`steamrollArray([1, [], [3, [[4]]]])` deve retornar `[1, 3, 4]`.
 
 ```js
 assert.deepEqual(steamrollArray([1, [], [3, [[4]]]]), [1, 3, 4]);
 ```
 
-`steamrollArray([1, {}, [3, [[4]]]])` should return `[1, {}, 3, 4]`.
+`steamrollArray([1, {}, [3, [[4]]]])` deve retornar `[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.
+Sua solução não deve usar os métodos `Array.prototype.flat()` ou `Array.prototype.flatMap()`.
 
 ```js
 assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
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
index a7dbdaeecc..94c901e7c4 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a3566b1109230028080c9345
-title: Sum All Numbers in a Range
+title: Soma Todos os Números em um intervalo
 challengeType: 5
 forumTopicId: 16083
 dashedName: sum-all-numbers-in-a-range
@@ -8,37 +8,37 @@ 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.
+Vamos passar um array de dois números. Retorne a soma desses dois números mais a soma de todos os números entre eles. O menor número nem sempre chegará primeiro.
 
-For example, `sumAll([4,1])` should return `10` because sum of all the numbers between 1 and 4 (both inclusive) is `10`.
+Por exemplo, `somAll([4, 1])` deve retornar `10` porque a soma de todos os números entre 1 e 4 (ambos incluídos) é `10`.
 
 # --hints--
 
-`sumAll([1, 4])` should return a number.
+`sumAll([1, 4])` deve ser um número.
 
 ```js
 assert(typeof sumAll([1, 4]) === 'number');
 ```
 
-`sumAll([1, 4])` should return 10.
+`sumAll([1, 4])` deve retornar 10.
 
 ```js
 assert.deepEqual(sumAll([1, 4]), 10);
 ```
 
-`sumAll([4, 1])` should return 10.
+`sumAll([4, 1])` deve retornar 10.
 
 ```js
 assert.deepEqual(sumAll([4, 1]), 10);
 ```
 
-`sumAll([5, 10])` should return 45.
+`sumAll([5, 10])` deve retornar 45.
 
 ```js
 assert.deepEqual(sumAll([5, 10]), 45);
 ```
 
-`sumAll([10, 5])` should return 45.
+`sumAll([10, 5])` deve retornar 45.
 
 ```js
 assert.deepEqual(sumAll([10, 5]), 45);
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
index 0c5b625e71..e4b0b06bbe 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a5229172f011153519423690
-title: Sum All Odd Fibonacci Numbers
+title: Soma todos os números ímpares de Fibonacci
 challengeType: 5
 forumTopicId: 16084
 dashedName: sum-all-odd-fibonacci-numbers
@@ -8,45 +8,45 @@ 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`.
+Dado um `num` inteiro e positivo, retorne a soma de todos os números ímpares Fibonacci menores que ou iguais a `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.
+Os dois primeiros números na sequência de Fibonacci são 1 e 1. Todo número adicional na sequência é a soma dos dois números anteriores. Os seis primeiros números da sequência de Fibonacci são 1, 1, 2, 3, 5 e 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.
+Por exemplo, `sumFibs(10)` deve retornar `10` porque todos os números ímpares de Fibonacci menores ou iguais a `10` são 1, 1, 3 e 5.
 
 # --hints--
 
-`sumFibs(1)` should return a number.
+`sumFibs(1)` deve retornar um número.
 
 ```js
 assert(typeof sumFibs(1) === 'number');
 ```
 
-`sumFibs(1000)` should return 1785.
+`sumFibs(1000)` deve retornar 1785.
 
 ```js
 assert(sumFibs(1000) === 1785);
 ```
 
-`sumFibs(4000000)` should return 4613732.
+`sumFibs(4000000)` deve retornar 4613732.
 
 ```js
 assert(sumFibs(4000000) === 4613732);
 ```
 
-`sumFibs(4)` should return 5.
+`sumFibs(4)` deve retornar 5.
 
 ```js
 assert(sumFibs(4) === 5);
 ```
 
-`sumFibs(75024)` should return 60696.
+`sumFibs(75024)` deve retornar 60696.
 
 ```js
 assert(sumFibs(75024) === 60696);
 ```
 
-`sumFibs(75025)` should return 135721.
+`sumFibs(75025)` deve retornar 135721.
 
 ```js
 assert(sumFibs(75025) === 135721);
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
index 57295dd11e..6b4f9c88df 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a3bfc1673c0526e06d3ac698
-title: Sum All Primes
+title: Somar Todos os Primos
 challengeType: 5
 forumTopicId: 16085
 dashedName: sum-all-primes
@@ -8,25 +8,25 @@ 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.
+Um <dfn>número primo</dfn> é um número natural maior que 1 com exatamente dois divisores: 1 e ele mesmo. Por exemplo, 2 é um número primo porque só é divisível por 1 e 2. Em contrapartida, 4 não é primo, uma vez que é divisível por 1, 2 e 4.
 
-Rewrite `sumPrimes` so it returns the sum of all prime numbers that are less than or equal to num.
+Reescreva `sumPrimes` para que ele retorne a soma de todos os números primos que são menores ou iguais a num.
 
 # --hints--
 
-`sumPrimes(10)` should return a number.
+`sumPrimes(10)` deve retornar um número.
 
 ```js
 assert.deepEqual(typeof sumPrimes(10), 'number');
 ```
 
-`sumPrimes(10)` should return 17.
+`sumPrimes(10)` deve retornar 17.
 
 ```js
 assert.deepEqual(sumPrimes(10), 17);
 ```
 
-`sumPrimes(977)` should return 73156.
+`sumPrimes(977)` deve retornar 73156.
 
 ```js
 assert.deepEqual(sumPrimes(977), 73156);
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
index b0a565be94..b999a73f7f 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a8e512fbe388ac2f9198f0fa
-title: Wherefore art thou
+title: Onde está você
 challengeType: 5
 forumTopicId: 16092
 dashedName: wherefore-art-thou
@@ -8,13 +8,13 @@ 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.
+Faça uma função que olha através de um array de objetos (primeiro argumento) e retorna um array de todos os objetos que têm pares de nome e valor correspondentes (segundo argumento). Cada par de nome e valor do objeto fonte tem que estar presente no objeto da coleção se ele for ser incluído no array retornado.
 
-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.
+Por exemplo, se o primeiro argumento é `[{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }]`, e o segundo argumento é `{ last: "Capulet" }`, em seguida, você deve retornar o terceiro objeto do array (o primeiro argumento), porque contém o nome e o seu valor, que foi passado como segundo argumento.
 
 # --hints--
 
-`whatIsInAName([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" })` should return `[{ first: "Tybalt", last: "Capulet" }]`.
+`whatIsInAName([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" })` deve retornar `[{ first: "Tybalt", last: "Capulet" }]`.
 
 ```js
 assert.deepEqual(
@@ -30,7 +30,7 @@ assert.deepEqual(
 );
 ```
 
-`whatIsInAName([{ "apple": 1 }, { "apple": 1 }, { "apple": 1, "bat": 2 }], { "apple": 1 })` should return `[{ "apple": 1 }, { "apple": 1 }, { "apple": 1, "bat": 2 }]`.
+`whatIsInAName([{ "apple": 1 }, { "apple": 1 }, { "apple": 1, "bat": 2 }], { "apple": 1 })` deve retornar `[{ "apple": 1 }, { "apple": 1 }, { "apple": 1, "bat": 2 }]`.
 
 ```js
 assert.deepEqual(
@@ -41,7 +41,7 @@ assert.deepEqual(
 );
 ```
 
-`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 }]`.
+`whatIsInAName([{ "apple": 1, "bat": 2 }, { "bat": 2 }, { "apple": 1, "bat": 2, "cookie": 2 }], { "apple": 1, "bat": 2 })` deve retornar `[{ "apple": 1, "bat": 2 }, { "apple": 1, "bat": 2, "cookie": 2 }]`.
 
 ```js
 assert.deepEqual(
@@ -56,7 +56,7 @@ assert.deepEqual(
 );
 ```
 
-`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 }]`.
+`whatIsInAName([{ "apple": 1, "bat": 2 }, { "apple": 1 }, { "apple": 1, "bat": 2, "cookie": 2 }], { "apple": 1, "cookie": 2 })` deve retornar `[{ "apple": 1, "bat": 2, "cookie": 2 }]`.
 
 ```js
 assert.deepEqual(
@@ -68,7 +68,7 @@ assert.deepEqual(
 );
 ```
 
-`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 }]`.
+`whatIsInAName([{ "apple": 1, "bat": 2 }, { "apple": 1 }, { "apple": 1, "bat": 2, "cookie": 2 }, { "bat":2 }], { "apple": 1, "bat": 2 })` deve retornar `[{ "apple": 1, "bat": 2 }, { "apple": 1, "bat": 2, "cookie":2 }]`.
 
 ```js
 assert.deepEqual(
@@ -88,7 +88,7 @@ assert.deepEqual(
 );
 ```
 
-`whatIsInAName([{"a": 1, "b": 2, "c": 3}], {"a": 1, "b": 9999, "c": 3})` should return `[]`
+`whatIsInAName([{"a": 1, "b": 2, "c": 3}], {"a": 1, "b": 9999, "c": 3})` deve retornar `[]`
 
 ```js
 assert.deepEqual(
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
index b94a388ea0..a5aa3e63ce 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 56533eb9ac21ba0edf2244e2
-title: Caesars Cipher
+title: Cifra de César
 challengeType: 5
 forumTopicId: 16003
 dashedName: caesars-cipher
@@ -8,35 +8,35 @@ 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.
+Uma das <dfn>cifras</dfn> mais simples e mais conhecidas é a <dfn>cifra de César</dfn>, também conhecida como uma <dfn>cifra de mudança</dfn>. Em uma cifra de transferência, os significados das letras são deslocados de acordo com a quantidade definida.
 
-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.
+Um uso moderno comum é a cifra [ROT13](https://en.wikipedia.org/wiki/ROT13), onde os valores das letras são deslocados em 13 lugares. Da seguinte forma: `A ↔ N`, `B ↔ O` e assim por diante.
 
-Write a function which takes a [ROT13](https://en.wikipedia.org/wiki/ROT13) encoded string as input and returns a decoded string.
+Escreva uma função que recebe uma string codificada de [ROT13](https://en.wikipedia.org/wiki/ROT13) como entrada e retorna uma string decodificada.
 
-All letters will be uppercase. Do not transform any non-alphabetic character (i.e. spaces, punctuation), but do pass them on.
+Todas as letras serão maiúsculas. Não transforme nenhum caractere não-alfabético (ou seja, espaços, pontuação), mas passe por eles.
 
 # --hints--
 
-`rot13("SERR PBQR PNZC")` should decode to the string `FREE CODE CAMP`
+`rot13("SERR PBQR PNZC")` deve decodificar para a string `FREE CODE CAMP`
 
 ```js
 assert(rot13('SERR PBQR PNZC') === 'FREE CODE CAMP');
 ```
 
-`rot13("SERR CVMMN!")` should decode to the string `FREE PIZZA!`
+`rot13("SERR CVMMN!")` deve decodificar para a string `FREE PIZZA!`
 
 ```js
 assert(rot13('SERR CVMMN!') === 'FREE PIZZA!');
 ```
 
-`rot13("SERR YBIR?")` should decode to the string `FREE LOVE?`
+`rot13("SERR YBIR?")` deve decodificar para a 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.`
+`rot13("GUR DHVPX OEBJA SBK WHZCF BIRE GUR YNML QBT.")`deve decodificar para a string `THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.`
 
 ```js
 assert(
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
index 49336bf373..193933994f 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: aa2e6f85cab2ab736c9a9b24
-title: Cash Register
+title: Caixa Registradora
 challengeType: 5
 forumTopicId: 16012
 dashedName: cash-register
@@ -8,21 +8,21 @@ 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.
+Implemente uma função de registradora de caixa `checkCashRegister()` que aceita o preço de compra como o primeiro argumento (`price`), pagamento como o segundo argumento (`cash`) e dinheiro na registradora (`cid`) como o terceiro argumento.
 
-`cid` is a 2D array listing available currency.
+`cid` é um array de duas dimensões listando a moeda disponível e a quantidade.
 
-The `checkCashRegister()` function should always return an object with a `status` key and a `change` key.
+A função `checkCashRegister()` deve sempre retornar um objeto com a chave `status` e uma chave `change`.
 
-Return `{status: "INSUFFICIENT_FUNDS", change: []}` if cash-in-drawer is less than the change due, or if you cannot return the exact change.
+Retorne `{status: "INSUFFICIENT_FUNDS", change: []}` se o dinheiro no caixa for menor que o troco devido, ou se você não pode retornar o troco exato.
 
-Return `{status: "CLOSED", change: [...]}` with cash-in-drawer as the value for the key `change` if it is equal to the change due.
+Retorne `{status: "CLOSED", change: [...]}` com dinheiro no caixa como o valor para a chave `change` se for igual ao troco devido.
 
-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.
+Caso contrário, retorne `{status: "OPEN", change: [...]}`, com o troco devido em moedas e notas, ordenado do maior para o menor, como o valor da chave `change`.
 
-<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>
+<table class='table table-striped'><tbody><tr><th>Unidade de moeda</th><th>Quantidade</th></tr><tr><td>Penny</td><td>$0,01 (MET)</td></tr><tr><td>Níquel</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>Dólar</td><td>$1 (UM)</td></tr><tr><td>Cinco Dólares</td><td>$5 (CINCO)</td></tr><tr><td>Dez Dólares</td><td>$10 (DEZ)</td></tr><tr><td>Vinte Dólares</td><td>$20 (VINTE)</td></tr><tr><td>Cem Dólares</td><td>$100 (CEM)</td></tr></tbody></table>
 
-See below for an example of a cash-in-drawer array:
+Veja abaixo um exemplo de um array de dinheiro no caixa (cid):
 
 ```js
 [
@@ -40,7 +40,7 @@ See below for an example of a cash-in-drawer array:
 
 # --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.
+`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]])` deve retornar um objeto.
 
 ```js
 assert.deepEqual(
@@ -61,7 +61,7 @@ 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]])` should return `{status: "OPEN", change: [["QUARTER", 0.5]]}`.
+`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]])` deve retornar `{status: "OPEN", change: [["QUARTER", 0.5]]}`.
 
 ```js
 assert.deepEqual(
@@ -80,7 +80,7 @@ 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]])` should return `{status: "OPEN", change: [["TWENTY", 60], ["TEN", 20], ["FIVE", 15], ["ONE", 1], ["QUARTER", 0.5], ["DIME", 0.2], ["PENNY", 0.04]]}`.
+`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]])` deve retornar `{status: "OPEN", change: [["TWENTY", 60], ["TEN", 20], ["FIVE", 15], ["ONE", 1], ["QUARTER", 0.5], ["DIME", 0.2], ["PENNY", 0.04]]}`.
 
 ```js
 assert.deepEqual(
@@ -110,7 +110,7 @@ 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]])` should return `{status: "INSUFFICIENT_FUNDS", change: []}`.
+`checkCashRegister(19.5, 20, [["PENNY", 0.01], ["NICKEL", 0], ["DIME", 0], ["QUARTER", 0], ["ONE", 0], ["FIVE", 0], ["TEN", 0], ["TWENTY", 0], ["ONE HUNDRED", 0]])` deve retornar `{status: "INSUFFICIENT_FUNDS", change: []}`.
 
 ```js
 assert.deepEqual(
@@ -129,7 +129,7 @@ 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]])` should return `{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]])` deve retornar `{status: "INSUFFICIENT_FUNDS", change: []}`.
 
 ```js
 assert.deepEqual(
@@ -148,7 +148,7 @@ 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]])` 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]]}`.
+`checkCashRegister(19.5, 20, [["PENNY", 0.5], ["NICKEL", 0], ["DIME", 0], ["QUARTER", 0], ["ONE", 0], ["FIVE", 0], ["TEN", 0], ["TWENTY", 0], ["ONE HUNDRED", 0]])` deve retornar `{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(
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
index e6107a26b4..65e12eba56 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: aaa48de84e1ecc7c742e1124
-title: Palindrome Checker
+title: Verificador de Palíndromo
 challengeType: 5
 forumTopicId: 16004
 dashedName: palindrome-checker
@@ -8,91 +8,91 @@ dashedName: palindrome-checker
 
 # --description--
 
-Return `true` if the given string is a palindrome. Otherwise, return `false`.
+Retorne `true` se a string fornecida for um palíndromo. Caso contrário, retorne `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.
+Um <dfn>palíndromo</dfn> é uma palavra ou frase que é dita da mesma maneira na ordem natural que na ordem inversa, ignorando pontuação, capitalização e espaçamento.
 
-**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.
+**Nota:** Você precisará remover **todos os caracteres não alfanuméricos** (pontuação, espaços e símbolos) e transforme tudo na mesma capitalização (letra em minúsculo ou maiúsculo) para verificar se determinada palavra ou frase é um palíndromo.
 
-We'll pass strings with varying formats, such as `racecar`, `RaceCar`, and `race CAR` among others.
+Vamos passar strings em diferentes formatos, como `racecar`, `RaceCarar` e `race CAR` entre outros.
 
-We'll also pass strings with special symbols, such as `2A3*3a2`, `2A3 3a2`, and `2_A3*3#A2`.
+Nós também passaremos strings com símbolos especiais, como `2A3*3a2`, `2A3 3a2` e `2_A3*3#A2`.
 
 # --hints--
 
-`palindrome("eye")` should return a boolean.
+`palindrome("eye")` deve retornar um booleano.
 
 ```js
 assert(typeof palindrome('eye') === 'boolean');
 ```
 
-`palindrome("eye")` should return `true`.
+`palindrome("eye")` deve retornar `true`.
 
 ```js
 assert(palindrome('eye') === true);
 ```
 
-`palindrome("_eye")` should return `true`.
+`palindrome("_eye")` deve retornar `true`.
 
 ```js
 assert(palindrome('_eye') === true);
 ```
 
-`palindrome("race car")` should return `true`.
+`palindrome("race car")` deve retornar `true`.
 
 ```js
 assert(palindrome('race car') === true);
 ```
 
-`palindrome("not a palindrome")` should return `false`.
+`palindrome("not a palindrome")` deve retornar `false`.
 
 ```js
 assert(palindrome('not a palindrome') === false);
 ```
 
-`palindrome("A man, a plan, a canal. Panama")` should return `true`.
+`palindrome("A man, a plan, a canal. Panama")` deve retornar `true`.
 
 ```js
 assert(palindrome('A man, a plan, a canal. Panama') === true);
 ```
 
-`palindrome("never odd or even")` should return `true`.
+`palindrome("never odd or even")` deve retornar `true`.
 
 ```js
 assert(palindrome('never odd or even') === true);
 ```
 
-`palindrome("nope")` should return `false`.
+`palindrome("nope")` deve retornar `false`.
 
 ```js
 assert(palindrome('nope') === false);
 ```
 
-`palindrome("almostomla")` should return `false`.
+`palindrome("almostomla")` deve retornar `false`.
 
 ```js
 assert(palindrome('almostomla') === false);
 ```
 
-`palindrome("My age is 0, 0 si ega ym.")` should return `true`.
+`palindrome("My age is 0, 0 si ega ym.")` deve retornar `true`.
 
 ```js
 assert(palindrome('My age is 0, 0 si ega ym.') === true);
 ```
 
-`palindrome("1 eye for of 1 eye.")` should return `false`.
+`palindrome("1 eye for of 1 eye.")` deve retornar `false`.
 
 ```js
 assert(palindrome('1 eye for of 1 eye.') === false);
 ```
 
-`palindrome("0_0 (: /-\ :) 0-0")` should return `true`.
+`palindrome("0_0 (: /-\ :) 0-0")` deve retornar `true`.
 
 ```js
 assert(palindrome('0_0 (: /- :) 0-0') === true);
 ```
 
-`palindrome("five|\_/|four")` should return `false`.
+`palindrome("five|\_/|four")` deve retornar `false`.
 
 ```js
 assert(palindrome('five|_/|four') === 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
index 78d91a3ec9..62367811fa 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: a7f4d8f2483413a6ce226cac
-title: Roman Numeral Converter
+title: Conversor de Numerais Romanos
 challengeType: 5
 forumTopicId: 16044
 dashedName: roman-numeral-converter
@@ -8,163 +8,163 @@ dashedName: roman-numeral-converter
 
 # --description--
 
-Convert the given number into a roman numeral.
+Converta o número dado em um número romano.
 
-All [roman numerals](http://www.mathsisfun.com/roman-numerals.html) answers should be provided in upper-case.
+Todas as respostas de [números romanos](http://www.mathsisfun.com/roman-numerals.html) devem ser fornecidas em maiúsculas.
 
 # --hints--
 
-`convertToRoman(2)` should return the string `II`.
+`convertToRoman(2)` deve retornar a string `II`.
 
 ```js
 assert.deepEqual(convertToRoman(2), 'II');
 ```
 
-`convertToRoman(3)` should return the string `III`.
+`convertToRoman(3)` deve retornar a string `III`.
 
 ```js
 assert.deepEqual(convertToRoman(3), 'III');
 ```
 
-`convertToRoman(4)` should return the string `IV`.
+`convertToRoman(4)` deve retornar a string `IV`.
 
 ```js
 assert.deepEqual(convertToRoman(4), 'IV');
 ```
 
-`convertToRoman(5)` should return the string `V`.
+`convertToRoman(5)` deve retornar a string `V`.
 
 ```js
 assert.deepEqual(convertToRoman(5), 'V');
 ```
 
-`convertToRoman(9)` should return the string `IX`.
+`convertToRoman(9)` deve retornar a string `IX`.
 
 ```js
 assert.deepEqual(convertToRoman(9), 'IX');
 ```
 
-`convertToRoman(12)` should return the string `XII`.
+`convertToRoman(12)` deve retornar a string `XII`.
 
 ```js
 assert.deepEqual(convertToRoman(12), 'XII');
 ```
 
-`convertToRoman(16)` should return the string `XVI`.
+`convertToRoman(16)` deve retornar a string `XVI`.
 
 ```js
 assert.deepEqual(convertToRoman(16), 'XVI');
 ```
 
-`convertToRoman(29)` should return the string `XXIX`.
+`convertToRoman(29)` deve retornar a string `XXIX`.
 
 ```js
 assert.deepEqual(convertToRoman(29), 'XXIX');
 ```
 
-`convertToRoman(44)` should return the string `XLIV`.
+`convertToRoman(44)` deve retornar a string `XLIV`.
 
 ```js
 assert.deepEqual(convertToRoman(44), 'XLIV');
 ```
 
-`convertToRoman(45)` should return the string `XLV`.
+`convertToRoman(45)` deve retornar a string `XLV`.
 
 ```js
 assert.deepEqual(convertToRoman(45), 'XLV');
 ```
 
-`convertToRoman(68)` should return the string `LXVIII`
+`convertToRoman(68)` deve retornar a string `LXVIII`
 
 ```js
 assert.deepEqual(convertToRoman(68), 'LXVIII');
 ```
 
-`convertToRoman(83)` should return the string `LXXXIII`
+`convertToRoman(83)` deve retornar a string `LXXXIII`
 
 ```js
 assert.deepEqual(convertToRoman(83), 'LXXXIII');
 ```
 
-`convertToRoman(97)` should return the string `XCVII`
+`convertToRoman(97)` deve retornar a string `XCVII`
 
 ```js
 assert.deepEqual(convertToRoman(97), 'XCVII');
 ```
 
-`convertToRoman(99)` should return the string `XCIX`
+`convertToRoman(99)` deve retornar a string `XCIX`
 
 ```js
 assert.deepEqual(convertToRoman(99), 'XCIX');
 ```
 
-`convertToRoman(400)` should return the string `CD`
+`convertToRoman(400)` deve retornar a string `CD`
 
 ```js
 assert.deepEqual(convertToRoman(400), 'CD');
 ```
 
-`convertToRoman(500)` should return the string `D`
+`convertToRoman(500)` deve retornar a string `D`
 
 ```js
 assert.deepEqual(convertToRoman(500), 'D');
 ```
 
-`convertToRoman(501)` should return the string `DI`
+`convertToRoman(501)` deve retornar a string `DI`
 
 ```js
 assert.deepEqual(convertToRoman(501), 'DI');
 ```
 
-`convertToRoman(649)` should return the string `DCXLIX`
+`convertToRoman(649)` deve retornar a string `DCXLIX`
 
 ```js
 assert.deepEqual(convertToRoman(649), 'DCXLIX');
 ```
 
-`convertToRoman(798)` should return the string `DCCXCVIII`
+`convertToRoman(798)` deve retornar a string `DCCXCVIII`
 
 ```js
 assert.deepEqual(convertToRoman(798), 'DCCXCVIII');
 ```
 
-`convertToRoman(891)` should return the string `DCCCXCI`
+`convertToRoman(891)` deve retornar a string `DCCCXCI`
 
 ```js
 assert.deepEqual(convertToRoman(891), 'DCCCXCI');
 ```
 
-`convertToRoman(1000)` should return the string `M`
+`convertToRoman(1000)` deve retornar a string `M`
 
 ```js
 assert.deepEqual(convertToRoman(1000), 'M');
 ```
 
-`convertToRoman(1004)` should return the string `MIV`
+`convertToRoman(1004)` deve retornar a string `MIV`
 
 ```js
 assert.deepEqual(convertToRoman(1004), 'MIV');
 ```
 
-`convertToRoman(1006)` should return the string `MVI`
+`convertToRoman(1006)` deve retornar a string `MVI`
 
 ```js
 assert.deepEqual(convertToRoman(1006), 'MVI');
 ```
 
-`convertToRoman(1023)` should return the string `MXXIII`
+`convertToRoman(1023)` deve retornar a string `MXXIII`
 
 ```js
 assert.deepEqual(convertToRoman(1023), 'MXXIII');
 ```
 
-`convertToRoman(2014)` should return the string `MMXIV`
+`convertToRoman(2014)` deve retornar a string `MMXIV`
 
 ```js
 assert.deepEqual(convertToRoman(2014), 'MMXIV');
 ```
 
-`convertToRoman(3999)` should return the string `MMMCMXCIX`
+`convertToRoman(3999)` deve retornar a string `MMMCMXCIX`
 
 ```js
 assert.deepEqual(convertToRoman(3999), 'MMMCMXCIX');
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
index 32b65ff902..aa0f98c21f 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: aff0395860f5d3034dc0bfc9
-title: Telephone Number Validator
+title: Validador de Número Telefônico
 challengeType: 5
 forumTopicId: 16090
 dashedName: telephone-number-validator
@@ -8,179 +8,179 @@ dashedName: telephone-number-validator
 
 # --description--
 
-Return `true` if the passed string looks like a valid US phone number.
+Retorna `true` se a string fornecida se parece com um número telefônico dos Estados Unidos válido.
 
-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):
+O usuário pode preencher o campo do formulário de qualquer maneira que escolher contanto que tenha o formato de um número válido dos EUA. Os seguintes são exemplos de formatos válidos para números nos EUA (consulte os testes abaixo para outras variantes):
 
 <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`.
+Para este desafio, você vai receber uma string como `800-692-7753` ou `8oo-six427676;laskdjf`. Seu trabalho é validar ou rejeitar o número de telefone dos EUA com base em qualquer combinação dos formatos fornecidos acima. O código de área é obrigatório. Se o código do país é fornecido, você deve confirmar que o código do país é `1`. Retorne `true` se a seqüência de caracteres for um número válido de telefone dos EUA; caso contrário, retorne `false`.
 
 # --hints--
 
-`telephoneCheck("555-555-5555")` should return a boolean.
+`telephoneCheck("555-555-5555")` deve retornar um boolean.
 
 ```js
 assert(typeof telephoneCheck('555-555-5555') === 'boolean');
 ```
 
-`telephoneCheck("1 555-555-5555")` should return `true`.
+`telephoneCheck("1 555-555-5555")` deve retornar `true`.
 
 ```js
 assert(telephoneCheck('1 555-555-5555') === true);
 ```
 
-`telephoneCheck("1 (555) 555-5555")` should return `true`.
+`telephoneCheck("1 (555) 555-5555")` deve retornar `true`.
 
 ```js
 assert(telephoneCheck('1 (555) 555-5555') === true);
 ```
 
-`telephoneCheck("5555555555")` should return `true`.
+`telephoneCheck("5555555555")` deve retornar `true`.
 
 ```js
 assert(telephoneCheck('5555555555') === true);
 ```
 
-`telephoneCheck("555-555-5555")` should return `true`.
+`telephoneCheck("555-555-5555")` deve retornar `true`.
 
 ```js
 assert(telephoneCheck('555-555-5555') === true);
 ```
 
-`telephoneCheck("(555)555-5555")` should return `true`.
+`telephoneCheck("(555)555-5555")` deve retornar `true`.
 
 ```js
 assert(telephoneCheck('(555)555-5555') === true);
 ```
 
-`telephoneCheck("1(555)555-5555")` should return `true`.
+`telephoneCheck("1(555)555-5555")` deve retornar `true`.
 
 ```js
 assert(telephoneCheck('1(555)555-5555') === true);
 ```
 
-`telephoneCheck("555-5555")` should return `false`.
+`telephoneCheck("555-5555")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('555-5555') === false);
 ```
 
-`telephoneCheck("5555555")` should return `false`.
+`telephoneCheck("5555555")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('5555555') === false);
 ```
 
-`telephoneCheck("1 555)555-5555")` should return `false`.
+`telephoneCheck("1 555)555-5555")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('1 555)555-5555') === false);
 ```
 
-`telephoneCheck("1 555 555 5555")` should return `true`.
+`telephoneCheck("1 555 555 5555")` deve retornar `true`.
 
 ```js
 assert(telephoneCheck('1 555 555 5555') === true);
 ```
 
-`telephoneCheck("1 456 789 4444")` should return `true`.
+`telephoneCheck("1 456 789 4444")` deve retornar `true`.
 
 ```js
 assert(telephoneCheck('1 456 789 4444') === true);
 ```
 
-`telephoneCheck("123**&!!asdf#")` should return `false`.
+`telephoneCheck("123**&!!asdf#")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('123**&!!asdf#') === false);
 ```
 
-`telephoneCheck("55555555")` should return `false`.
+`telephoneCheck("55555555")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('55555555') === false);
 ```
 
-`telephoneCheck("(6054756961)")` should return `false`.
+`telephoneCheck("(6054756961)")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('(6054756961)') === false);
 ```
 
-`telephoneCheck("2 (757) 622-7382")` should return `false`.
+`telephoneCheck("2 (757) 622-7382")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('2 (757) 622-7382') === false);
 ```
 
-`telephoneCheck("0 (757) 622-7382")` should return `false`.
+`telephoneCheck("0 (757) 622-7382")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('0 (757) 622-7382') === false);
 ```
 
-`telephoneCheck("-1 (757) 622-7382")` should return `false`.
+`telephoneCheck("-1 (757) 622-7382")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('-1 (757) 622-7382') === false);
 ```
 
-`telephoneCheck("2 757 622-7382")` should return `false`.
+`telephoneCheck("2 757 622-7382")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('2 757 622-7382') === false);
 ```
 
-`telephoneCheck("10 (757) 622-7382")` should return `false`.
+`telephoneCheck("10 (757) 622-7382")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('10 (757) 622-7382') === false);
 ```
 
-`telephoneCheck("27576227382")` should return `false`.
+`telephoneCheck("27576227382")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('27576227382') === false);
 ```
 
-`telephoneCheck("(275)76227382")` should return `false`.
+`telephoneCheck("(275)76227382")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('(275)76227382') === false);
 ```
 
-`telephoneCheck("2(757)6227382")` should return `false`.
+`telephoneCheck("2(757)6227382")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('2(757)6227382') === false);
 ```
 
-`telephoneCheck("2(757)622-7382")` should return `false`.
+`telephoneCheck("2(757)622-7382")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('2(757)622-7382') === false);
 ```
 
-`telephoneCheck("555)-555-5555")` should return `false`.
+`telephoneCheck("555)-555-5555")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('555)-555-5555') === false);
 ```
 
-`telephoneCheck("(555-555-5555")` should return `false`.
+`telephoneCheck("(555-555-5555")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('(555-555-5555') === false);
 ```
 
-`telephoneCheck("(555)5(55?)-5555")` should return `false`.
+`telephoneCheck("(555)5(55?)-5555")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('(555)5(55?)-5555') === false);
 ```
 
-`telephoneCheck("55 55-55-555-5")` should return `false`.
+`telephoneCheck("55 55-55-555-5")` deve retornar `false`.
 
 ```js
 assert(telephoneCheck('55 55-55-555-5') === false);
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
index 33a5ab2895..1ac12de559 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db1367417b2b2512b87
-title: Add Methods After Inheritance
+title: Adicionar Métodos Após Herança
 challengeType: 1
 forumTopicId: 301315
 dashedName: add-methods-after-inheritance
@@ -8,9 +8,9 @@ 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.
+Uma função construtora, ou simplesmente construtor, que herda seu objeto de `protótipo` de uma função construtora de supertipo, além dos métodos herdados, ainda poderá ter seus próprios métodos.
 
-For example, `Bird` is a constructor that inherits its `prototype` from `Animal`:
+Por exemplo, `Bird` é um construtor que herda seu `protótipo` de `Animal`:
 
 ```js
 function Animal() { }
@@ -22,7 +22,7 @@ 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:
+Como adicional do que é herdado da classe `Animal`, você deseja adicionar o comportamento que é único de objetos `Bird`. Aqui, `Bird` irá definir a função `fly()`. As funções são adicionadas ao `protótipo` `Bird` da mesma forma que qualquer função construtora:
 
 ```js
 Bird.prototype.fly = function() {
@@ -30,7 +30,7 @@ Bird.prototype.fly = function() {
 };
 ```
 
-Now instances of `Bird` will have both `eat()` and `fly()` methods:
+Agora as instâncias de `Bird` terão ambos os métodos, `eat()` e `fly()`:
 
 ```js
 let duck = new Bird();
@@ -38,45 +38,45 @@ 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!`.
+`duck.eat()` exibe no console a string `nom nom nom`, e `duck.fly()` mostra a 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.
+Adiciona todos os códigos necessários para que o objeto `Dog` herde de `Animal` e o `protótipo` de construtor de `Dog` está definido para `Dog`. Então adiciona o método `bark()` para o objeto `Dog` para que um `beagle` possa `eat()` e `bark()`. O método `bark()` deveria imprimir no console a string: `Woof!`.
 
 # --hints--
 
-`Animal` should not respond to the `bark()` method.
+`Animal` não deve possuir o método `bark()`.
 
 ```js
 assert(typeof Animal.prototype.bark == 'undefined');
 ```
 
-`Dog` should inherit the `eat()` method from `Animal`.
+`Dog` deve herdar o método `eat()` de `Animal`.
 
 ```js
 assert(typeof Dog.prototype.eat == 'function');
 ```
 
-The `Dog` prototype should have a `bark()` method.
+O protótipo de `Dog` deve ter o método `bark()`.
 
 ```js
 assert('bark' in Dog.prototype);
 ```
 
-`beagle` should be an `instanceof` `Animal`.
+`beagle` deve ser uma `instância` de `Animal`.
 
 ```js
 assert(beagle instanceof Animal);
 ```
 
-The constructor for `beagle` should be set to `Dog`.
+O construtor para `beagle` deve ser definido para `Dog`.
 
 ```js
 assert(beagle.constructor === Dog);
 ```
 
-`beagle.eat()` should log the string `nom nom nom`
+`beagle.eat()` deve mostrar no console a string `nom nom nom`
 
 ```js
 console.log = function (msg) {
@@ -85,7 +85,7 @@ console.log = function (msg) {
 assert.throws(() => beagle.eat(), 'nom nom nom');
 ```
 
-`beagle.bark()` should log the string `Woof!`
+`beagle.bark()` deve mostrar no console a string `nom nom nom`
 
 ```js
 console.log = function (msg) {
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
index 5313994f24..b5f0bedd68 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7daf367417b2b2512b7f
-title: Change the Prototype to a New Object
+title: Mudar o Protótipo para um Novo Objeto
 challengeType: 1
 forumTopicId: 301316
 dashedName: change-the-prototype-to-a-new-object
@@ -8,13 +8,13 @@ dashedName: change-the-prototype-to-a-new-object
 
 # --description--
 
-Up until now you have been adding properties to the `prototype` individually:
+Até o momento, você tem adicionado propriedades para cada `protótipo` individualmente:
 
 ```js
 Bird.prototype.numLegs = 2;
 ```
 
-This becomes tedious after more than a few properties.
+Isto se torna entediante após mais do que algumas propriedades.
 
 ```js
 Bird.prototype.eat = function() {
@@ -26,7 +26,7 @@ Bird.prototype.describe = function() {
 }
 ```
 
-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:
+Uma forma mais eficiente é definir o `protótipo` para um novo objeto que já possui as propriedades. Dessa maneira, as propriedades são adicionadas todas de uma vez:
 
 ```js
 Bird.prototype = {
@@ -42,29 +42,29 @@ Bird.prototype = {
 
 # --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.
+Adiciona a propriedade `numLegs` e os dois métodos `eat()` e `describe()` para o `protótipo` de `Dog` definindo o `protótipo` para um novo objeto.
 
 # --hints--
 
-`Dog.prototype` should be set to a new object.
+`Dog.prototype` deve ser definido para um novo objeto.
 
 ```js
 assert(/Dog\.prototype\s*?=\s*?{/.test(code));
 ```
 
-`Dog.prototype` should have the property `numLegs`.
+`Dog.prototype` deve ter a propriedade `numLegs`.
 
 ```js
 assert(Dog.prototype.numLegs !== undefined);
 ```
 
-`Dog.prototype` should have the method `eat()`.
+`Dog.prototype` deve ter o método `eat()`.
 
 ```js
 assert(typeof Dog.prototype.eat === 'function');
 ```
 
-`Dog.prototype` should have the method `describe()`.
+`Dog.prototype` deve ter o método `describe()`.
 
 ```js
 assert(typeof Dog.prototype.describe === 'function');
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
index c58ecb52ce..c7a8ed8f0a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dac367417b2b2512b73
-title: Create a Basic JavaScript Object
+title: Crie um Objeto JavaScript Básico
 challengeType: 1
 forumTopicId: 301317
 dashedName: create-a-basic-javascript-object
@@ -8,13 +8,13 @@ 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.
+Pense sobre as coisas que as pessoas veem todos os dias, como carros, lojas e pássaros. Tudo isso são <dfn>objetos</dfn>: coisas tangíveis com que pessoas podem observar e interagir.
 
-What are some qualities of these objects? A car has wheels. Shops sell items. Birds have wings.
+Quais são algumas qualidades destes objetos? Um carro possui rodas. Lojas vendem itens. Pássaros possuem asas.
 
-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.
+Estas qualidades, ou <dfn>propriedades</dfn>, definem o que faz um objeto. Note que objetos similares compartilham de propriedades iguais, mas podem ter diferentes valores para estas propriedades. Por exemplo, todos os carros possuem rodas, mas nem todos os carros possuem o mesmo número de rodas.
 
-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:
+Objetos em JavaScript são utilizados como modelos de objetos do mundo real, dando a eles propriedades e comportamentos assim como se fossem análogos ao mundo real. Aqui está um exemplo utilizando estes conceitos para a criação de um objeto `duck`:
 
 ```js
 let duck = {
@@ -23,27 +23,27 @@ let duck = {
 };
 ```
 
-This `duck` object has two property/value pairs: a `name` of `Aflac` and a `numLegs` of 2.
+O objeto `duck` possui dois pares de propriedades/valores: um `name` sendo `Aflac` e um `numLegs` sendo 2.
 
 # --instructions--
 
-Create a `dog` object with `name` and `numLegs` properties, and set them to a string and a number, respectively.
+Cria um objeto `dog` com as propriedades `name` e `numLegs`, e definem eles como sendo do tipo string e numérico, respectivamente.
 
 # --hints--
 
-`dog` should be an object.
+`dog` deve ser um objeto.
 
 ```js
 assert(typeof dog === 'object');
 ```
 
-`dog` should have a `name` property set to a string.
+`dog` deve ter uma propriedade `name` definido para uma string.
 
 ```js
 assert(typeof dog.name === 'string');
 ```
 
-`dog` should have a `numLegs` property set to a number.
+`dog` deve ter uma propriedade `numLeggs` definido para um número.
 
 ```js
 assert(typeof dog.numLegs === 'number');
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
index 38b5cdb233..8d4b9f8917 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dad367417b2b2512b75
-title: Create a Method on an Object
+title: Cria um Método em um Objeto
 challengeType: 1
 forumTopicId: 301318
 dashedName: create-a-method-on-an-object
@@ -8,9 +8,9 @@ dashedName: create-a-method-on-an-object
 
 # --description--
 
-Objects can have a special type of property, called a <dfn>method</dfn>.
+Objetos podem ter um tipo especial de propriedade, chamado de <dfn>método</dfn>.
 
-Methods are properties that are functions. This adds different behavior to an object. Here is the `duck` example with a method:
+Métodos e propriedades são funções. Isso adiciona diferentes comportamentos para um objeto. Aqui está o exemplo `duck` com um método:
 
 ```js
 let duck = {
@@ -21,21 +21,21 @@ let duck = {
 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.
+O exemplo adiciona o método `sayName`, que é uma função responsável por retornar uma frase contendo o nome do `duck`. Note que o método acessou a propriedade `name` na declaração de retorno usando `duck.name`. O próximo desafio irá mostrar outra forma de fazer isso.
 
 # --instructions--
 
-Using the `dog` object, give it a method called `sayLegs`. The method should return the sentence `This dog has 4 legs.`
+Usando o objeto `dog`, de a ele um método chamado `sayLegs`. O método deve retornar a frase `This dog has 4 legs. (Este cachorro possui 4 pernas.)`
 
 # --hints--
 
-`dog.sayLegs()` should be a function.
+`dog.sayLegs()` deve ser uma função.
 
 ```js
 assert(typeof dog.sayLegs === 'function');
 ```
 
-`dog.sayLegs()` should return the given string - note that punctuation and spacing matter.
+`dog.sayLegs()` deve retornar a string definida - note que pontuação e espaçamento importa.
 
 ```js
 assert(dog.sayLegs() === 'This dog has 4 legs.');
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
index 91e7d84cd1..2a3f9e1544 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dad367417b2b2512b77
-title: Define a Constructor Function
+title: Define uma Função Construtora
 challengeType: 1
 forumTopicId: 16804
 dashedName: define-a-constructor-function
@@ -8,9 +8,9 @@ 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.
+<dfn>Construtores</dfn> são funções que criam novos objetos. Eles definem propriedades e comportamentos que pertencerão ao novo objeto. Pense neles como uma planta para a criação de novos objetos.
 
-Here is an example of a constructor:
+Aqui está um exemplo de construtor:
 
 ```js
 function Bird() {
@@ -20,29 +20,29 @@ function Bird() {
 }
 ```
 
-This constructor defines a `Bird` object with properties `name`, `color`, and `numLegs` set to Albert, blue, and 2, respectively. Constructors follow a few conventions:
+O construtor define um objeto `Bird` com propriedades `name`, `color`, e `numLegs` definidos como Albert, blue e 2, respectivamente. Construtores seguem algumas convenções:
 
-<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>
+<ul><li>Construtores são definidos com a primeira letra do nome maiúscula para distinguir eles de outras funções que não são <code>construtores</code>.</li><li>Construtores usam a palavra-chave <code>this</code> para definir as propriedades do objeto que eles irão criar. Dentro do construtor, <code>this</code> referencia para um novo objeto quer irá ser criado.</li><li>Construtores definem propriedades e comportamentos em vez de retornar valores como outras funções podem fazer.</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.
+Crie um construtor, `Dog`, com as propriedades `name`, `color` e `numLegs` que são definidos como string, string e número, respectivamente.
 
 # --hints--
 
-`Dog` should have a `name` property set to a string.
+`Dog` deve term uma propriedade `name` definida como uma string.
 
 ```js
 assert(typeof new Dog().name === 'string');
 ```
 
-`Dog` should have a `color` property set to a string.
+`Dog` deve ter a propriedade `color` definida como uma string.
 
 ```js
 assert(typeof new Dog().color === 'string');
 ```
 
-`Dog` should have a `numLegs` property set to a number.
+`Dog` deve ter a propriedade `numLegs` definida como um número.
 
 ```js
 assert(typeof new Dog().numLegs === 'number');
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
index 5f803b1d61..64eae9fdf0 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dae367417b2b2512b79
-title: Extend Constructors to Receive Arguments
+title: Estenda Construtores para Receber Argumentos
 challengeType: 1
 forumTopicId: 18235
 dashedName: extend-constructors-to-receive-arguments
@@ -8,7 +8,7 @@ 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:
+Os construtores `Bird` e `Dog` do último desafio funcionaram bem. No entanto, note que todos os `Birds` que são criados com o construtor `Bird` são automaticamente nomeados Albeart, são da cor azul e possuem duas pernas. E se você deseja pássaros com diferentes valores para seus nomes e cores? É possível alterar estas propriedades de cada pássaro manualmente, mas isso daria bastante trabalho:
 
 ```js
 let swan = new Bird();
@@ -16,7 +16,7 @@ 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:
+Suponha que você está escrevendo um programa para registrar centenas ou até milhares de diferentes pássaros em um aviário. Seria necessário muito tempo para criar todos estes pássaros, e então alterar as propriedades para os diferentes valores de cada um. Para criar diferentes objetos `Bird` de forma mais fácil, você pode projetar o construtor de Bird para aceitar parâmetros:
 
 ```js
 function Bird(name, color) {
@@ -26,7 +26,7 @@ function Bird(name, color) {
 }
 ```
 
-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:
+Em seguida, passe os valores como argumentos para definir cada pássaro único no construtor `Bird`: ` let cardinal = new Bird("Bruce","red");` Isso dará uma nova instância de `Bird` com as propriedades `name` e `color` definidas como `Bruce` e `red`, respectivamente. A propriedade `numLegs` ainda está definida como 2. O `cardinal` possui três propriedades:
 
 ```js
 cardinal.name
@@ -34,33 +34,33 @@ 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.
+O construtor é mais flexível. Agora é possível definir as propriedades de cada `Bird` ao mesmo tempo em que são criados, o que é uma grande utilidade dos construtores JavaScript. Eles agrupam junto objetos baseados em características e comportamentos compartilhados e definem uma planta que automatiza a criação deles.
 
 # --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.
+Crie outro construtor `Dog`. Desta vez, defina o construtor para receber os parâmetros `name` e `color`, e que tenham a propriedade `numLegs` fixada em 4. Em seguida, crie um novo `Dog` salvo na variável `terrier`. Passe duas strings como argumentos para as propriedades `name` e `color`.
 
 # --hints--
 
-`Dog` should receive an argument for `name`.
+`Dog` deve receber um argumento para `name`.
 
 ```js
 assert(new Dog('Clifford').name === 'Clifford');
 ```
 
-`Dog` should receive an argument for `color`.
+`Dog` deve receber um argumento para `color`.
 
 ```js
 assert(new Dog('Clifford', 'yellow').color === 'yellow');
 ```
 
-`Dog` should have property `numLegs` set to 4.
+`Dog` deve ter a propriedade `numLegs` definido como 4.
 
 ```js
 assert(new Dog('Clifford').numLegs === 4);
 ```
 
-`terrier` should be created using the `Dog` constructor.
+`terrier` deve ser criado usando o construtor `Dog`.
 
 ```js
 assert(terrier instanceof 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
index 27fa9f57b7..dbff968da3 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db0367417b2b2512b84
-title: Inherit Behaviors from a Supertype
+title: Herde Comportamentos de um Supertipo
 challengeType: 1
 forumTopicId: 301319
 dashedName: inherit-behaviors-from-a-supertype
@@ -8,7 +8,7 @@ dashedName: inherit-behaviors-from-a-supertype
 
 # --description--
 
-In the previous challenge, you created a `supertype` called `Animal` that defined behaviors shared by all animals:
+No desafio anterior, você criou um `supertipo` chamado `Animal` que define os comportamentos compartilhados por todos os animais:
 
 ```js
 function Animal() { }
@@ -17,46 +17,46 @@ Animal.prototype.eat = function() {
 };
 ```
 
-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:
+Este e o próximo desafio irá abordar como reutilizar métodos de `Animal` dentro de `Bird` e `Dog` sem ter de definir os métodos novamente. Ele utiliza uma técnica chamada herança. Este desafio cobrirá o primeiro passo: fazer uma instância do `supertipo` (ou parente). Você já sabe uma forma de criar instâncias de `Animal` utilizando o operador `new`:
 
 ```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:
+Há algumas desvantagens quando utilizamos essa sintaxe para herança, que são muito complexas para o escopo deste desafio. Em vez disso, aqui está uma abordagem alternativa sem essas desvantagens:
 
 ```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`.
+`Object.create(obj)` cria um novo objeto, e define `obj` como o novo `protótipo` do objeto. Lembre-se que o `protótipo` é como uma "receita" para criar um objeto. Ao definir o `prototype` de `animal` para ser um `prototype` de `Animal`, você está efetivamente dando a instância `animal` a mesma "receita" de qualquer outra instância de `Animal`.
 
 ```js
 animal.eat();
 animal instanceof Animal;
 ```
 
-The `instanceof` method here would return `true`.
+O método `instanceof` aqui irá retornar `true`.
 
 # --instructions--
 
-Use `Object.create` to make two instances of `Animal` named `duck` and `beagle`.
+Utilize `Object.create` para fazer duas instâncias de `Animal` nomeados `duck` e `beagle`.
 
 # --hints--
 
-The `duck` variable should be defined.
+A variável `duck` deve ser definida.
 
 ```js
 assert(typeof duck !== 'undefined');
 ```
 
-The `beagle` variable should be defined.
+A variável `beagle` deve ser definida.
 
 ```js
 assert(typeof beagle !== 'undefined');
 ```
 
-The `duck` variable should be initialised with `Object.create`.
+A variável `duck` deve ser inicializada com `Object.create`.
 
 ```js
 assert(
@@ -66,7 +66,7 @@ assert(
 );
 ```
 
-The `beagle` variable should be initialised with `Object.create`.
+A variável `beagle` deve ser inicializada com `Object.create`.
 
 ```js
 assert(
@@ -76,13 +76,13 @@ assert(
 );
 ```
 
-`duck` should have a `prototype` of `Animal`.
+`duck` deve ter o `protótipo` de `Animal`.
 
 ```js
 assert(duck instanceof Animal);
 ```
 
-`beagle` should have a `prototype` of `Animal`.
+`beagle` deve ter o `protótipo` de `Animal`.
 
 ```js
 assert(beagle instanceof Animal);
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
index a30165e632..98840dee30 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7daf367417b2b2512b7d
-title: Iterate Over All Properties
+title: Itere Sobre Todas as Propriedades
 challengeType: 1
 forumTopicId: 301320
 dashedName: iterate-over-all-properties
@@ -8,7 +8,7 @@ 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`.
+Até agora você já viu dois tipos de propriedades: as propriedades <dfn>own properties</dfn> e `prototype`. Propriedades próprias (ou Own properties) são definidas diretamente na própria instância do objeto. E as propriedades `prototype` são definidas no `prototype`.
 
 ```js
 function Bird(name) {
@@ -20,7 +20,7 @@ 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`:
+Aqui está como você adiciona own properties `duck` para o array `ownProps` e propriedades `prototype` para o array `prototypeProps`:
 
 ```js
 let ownProps = [];
@@ -38,27 +38,27 @@ console.log(ownProps);
 console.log(prototypeProps);
 ```
 
-`console.log(ownProps)` would display `["name"]` in the console, and `console.log(prototypeProps)` would display `["numLegs"]`.
+`console.log(ownProps)` deve exibir no console `["name"]`, e `console.log(prototypeProps)` exibirá no console `["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`.
+Adicione todas as propriedades próprias de `beagle` para o array `ownProps`. Adicione todas as propriedades `prototype` de `Dog` para o array `prototypeProps`.
 
 # --hints--
 
-The `ownProps` array should only contain `name`.
+O array `ownProps` deve conter apenas `name`.
 
 ```js
 assert.deepEqual(ownProps, ['name']);
 ```
 
-The `prototypeProps` array should only contain `numLegs`.
+O array `prototypeProps` deve conter apenas `numLegs`.
 
 ```js
 assert.deepEqual(prototypeProps, ['numLegs']);
 ```
 
-You should solve this challenge without using the built in method `Object.keys()`.
+Você deve resolver este desafio sem utilizar o método nativo `Object.keys()`.
 
 ```js
 assert(!/\Object.keys/.test(code));
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
index b0c80c8ee4..e8670a775c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dad367417b2b2512b76
-title: Make Code More Reusable with the this Keyword
+title: Faça Código Mais Reutilizável com a Palavra-Chave this
 challengeType: 1
 forumTopicId: 301321
 dashedName: make-code-more-reusable-with-the-this-keyword
@@ -8,15 +8,15 @@ 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:
+O último desafio introduziu um método ao objeto `duck`. Ele utiliza ponto notação (`duck.name`) para acessar o valor da propriedade `name` dentro da declaração de retorno:
 
 ```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.
+Enquanto isso é uma forma válida de acessar a propriedade do objeto, tem uma armadilha aqui. Se o nome da variável mudar, qualquer código referenciando o nome original seria necessário ser atualizado também. Em uma definição curta de objeto, isso não é um problema, mas se um objeto possui muitas referencias para suas propriedades, há uma chance maior de erro.
 
-A way to avoid these issues is with the `this` keyword:
+Uma forma para evitar estes problemas é utilizar a palavra-chave `this`:
 
 ```js
 let duck = {
@@ -26,21 +26,21 @@ let duck = {
 };
 ```
 
-`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.
+`this` é um tópico bem extenso e o exemplo acima é apenas uma forma de utilizá-lo. No contexto atual, `this` refere-se ao objeto que o método está associado à: `duck`. Se o nome do objeto é alterado para `mallard`, não é necessariamente para encontrar todas as referencias para `duck` no código. Isso torna o código reutilizável e legível.
 
 # --instructions--
 
-Modify the `dog.sayLegs` method to remove any references to `dog`. Use the `duck` example for guidance.
+Modifique o método `dog.sayLegs` para remover qualquer referencia para `dog`. Utilize o exemplo `duck` como guia.
 
 # --hints--
 
-`dog.sayLegs()` should return the given string.
+`dog.sayLegs()` deve retornar a string definida.
 
 ```js
 assert(dog.sayLegs() === 'This dog has 4 legs.');
 ```
 
-Your code should use the `this` keyword to access the `numLegs` property of `dog`.
+Seu código deve utilizar a palavra-chave `this` para acessar a propriedade `numLegs` de `dog`.
 
 ```js
 assert(code.match(/this\.numLegs/g));
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
index 6a531a5730..1d5e9f84af 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db1367417b2b2512b88
-title: Override Inherited Methods
+title: Sobrescreva Métodos Herdados
 challengeType: 1
 forumTopicId: 301322
 dashedName: override-inherited-methods
@@ -8,19 +8,19 @@ 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:
+Nas lições passadas, você aprendeu que um objeto pode herdar seus comportamentos (métodos) de outro objeto ao referenciar o `prototype` do objeto:
 
 ```js
 ChildObject.prototype = Object.create(ParentObject.prototype);
 ```
 
-Then the `ChildObject` received its own methods by chaining them onto its `prototype`:
+Em seguida, o `ChildObject` recebeu seu próprio método ao encadear eles neste `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`:
+É possível sobrescrever um método herdado. É feito da mesma maneira - ao adicionar o método a `ChildObject.prototype` utilizando o mesmo nome do método que aquele a ser sobrescrito. Aqui está um exemplo de `Bird` sobrescrevendo o método `eat()` herdado de `Animal`:
 
 ```js
 function Animal() { }
@@ -36,26 +36,26 @@ Bird.prototype.eat = function() {
 };
 ```
 
-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`:
+Se você tem uma instância `let duck = new Bird();` e você chamar `duck.eat()`, é assim que o JavaScript procura pelo método na cadeia de `prototype` de `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.
+1.  `duck` => o método `eat()` está definido aqui? Não.
+2.  `Bird` => o método `eat()` está definido aqui? => Sim. Execute isso e pare de procurar.
+3.  `Animal` => `eat()` também é definido, mas o JavaScript parou de procurar antes de chegar a este level.
+4.  Objeto => JavaScript parou de procurar antes de chegar a este nível.
 
 # --instructions--
 
-Override the `fly()` method for `Penguin` so that it returns the string `Alas, this is a flightless bird.`
+Sobrescreva o método `fly()` para `Penguin` para que retorne a string `Alas, this is a flightless bird.(Alas, isto é um pássaro que não voa.)`
 
 # --hints--
 
-`penguin.fly()` should return the string `Alas, this is a flightless bird.`
+`penguin.fly()` deve retornar a string `Alas, this is a flightless bird.(Infelizmente, este é um pássaro que não voa.)`
 
 ```js
 assert(penguin.fly() === 'Alas, this is a flightless bird.');
 ```
 
-The `bird.fly()` method should return the string `I am flying!`
+O método `bird.fly()` deve retornar a string `I am flying! (Eu estou voando)`
 
 ```js
 assert(new Bird().fly() === 'I am flying!');
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
index cd44cdceb3..1d1fe8f96a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7daf367417b2b2512b80
-title: Remember to Set the Constructor Property when Changing the Prototype
+title: Lembre-se de Definir a Propriedade Construtora quando Alterar o Protótipo
 challengeType: 1
 forumTopicId: 301323
 dashedName: remember-to-set-the-constructor-property-when-changing-the-prototype
@@ -8,7 +8,7 @@ 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:
+Tem um efeito colateral crucial de definir manualmente o protótipo de um novo objeto. Isso apaga a propriedade `construtor`! Essa propriedade pode ser utilizada para verificar qual função construtora criou a instância, mas já que a propriedade foi sobrescrita, agora retorna resultados falsos:
 
 ```js
 duck.constructor === Bird;
@@ -16,9 +16,9 @@ duck.constructor === Object;
 duck instanceof Bird;
 ```
 
-In order, these expressions would evaluate to `false`, `true`, and `true`.
+Em ordem, essas expressões seriam avaliadas a `false`, `true` e `true`.
 
-To fix this, whenever a prototype is manually set to a new object, remember to define the `constructor` property:
+Para corrigir isso, toda vez que o protótipo é manualmente definido para um novo objeto, lembre-se de definir a propriedade `construtor`:
 
 ```js
 Bird.prototype = {
@@ -35,11 +35,11 @@ Bird.prototype = {
 
 # --instructions--
 
-Define the `constructor` property on the `Dog` `prototype`.
+Define a propriedade `construtor` no `prototype` de `Dog`.
 
 # --hints--
 
-`Dog.prototype` should set the `constructor` property.
+`Dog.prototype` deve definir a propriedade `construtor`.
 
 ```js
 assert(Dog.prototype.constructor === Dog);
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
index 093cc3e740..6efb9eb808 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db1367417b2b2512b86
-title: Reset an Inherited Constructor Property
+title: Redefina uma Propriedade Construtora Herdada
 challengeType: 1
 forumTopicId: 301324
 dashedName: reset-an-inherited-constructor-property
@@ -8,9 +8,9 @@ dashedName: reset-an-inherited-constructor-property
 
 # --description--
 
-When an object inherits its `prototype` from another object, it also inherits the supertype's constructor property.
+Quando um objeto herda seu `protótipo` de outro objeto, ele também herda a propriedade construtora do supertipo.
 
-Here's an example:
+Aqui está um exemplo:
 
 ```js
 function Bird() { }
@@ -19,7 +19,7 @@ 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:
+Mas `duck` e todas as instâncias de `Bird` devem mostrar que eles foram construídos por `Bird` e não `Animal`. Para fazer isso, você pode manualmente definir a propriedade construtora de `Bird` para o objeto `Bird`:
 
 ```js
 Bird.prototype.constructor = Bird;
@@ -28,29 +28,29 @@ duck.constructor
 
 # --instructions--
 
-Fix the code so `duck.constructor` and `beagle.constructor` return their respective constructors.
+Corrija o código para que `duck.constructor` e `beagle.constructor` retornem seus respectivos construtores.
 
 # --hints--
 
-`Bird.prototype` should be an instance of `Animal`.
+`Bird.prototype` deve ser uma instância de `Animal`.
 
 ```js
 assert(Animal.prototype.isPrototypeOf(Bird.prototype));
 ```
 
-`duck.constructor` should return `Bird`.
+`duck.constructor` deve retornar `Bird`.
 
 ```js
 assert(duck.constructor === Bird);
 ```
 
-`Dog.prototype` should be an instance of `Animal`.
+`Dog.prototype` deve ser uma instância de `Animal`.
 
 ```js
 assert(Animal.prototype.isPrototypeOf(Dog.prototype));
 ```
 
-`beagle.constructor` should return `Dog`.
+`beagle.constructor` deve retornar `Dog`.
 
 ```js
 assert(beagle.constructor === 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
index 16bdccd2e3..e4d0d098f1 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db1367417b2b2512b85
-title: Set the Child's Prototype to an Instance of the Parent
+title: Defina o Protótipo de Child para ser uma Instância do Parent
 challengeType: 1
 forumTopicId: 301325
 dashedName: set-the-childs-prototype-to-an-instance-of-the-parent
@@ -8,30 +8,30 @@ 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`.
+No desafio anterior, você viu o primeiro passo para herdar comportamento do supertipo (ou parente) `Animal`: fazendo uma instância de `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`.
+Este desafio cobre o próximo passo: definir o `prototype` do subtipo (ou filho) - neste caso, `Bird` - para ser uma instância de `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`.
+Lembre-se que o `prototype` é como uma receita para criar um objeto. De certa forma, a receita para `Bird` agora inclui todos os "ingredientes" chave para `Animal`.
 
 ```js
 let duck = new Bird("Donald");
 duck.eat();
 ```
 
-`duck` inherits all of `Animal`'s properties, including the `eat` method.
+`duck` herda todas as propriedades de `Animal`, incluindo o método `eat`.
 
 # --instructions--
 
-Modify the code so that instances of `Dog` inherit from `Animal`.
+Modifique o código para que as instâncias de `Dog` herdem de `Animal`.
 
 # --hints--
 
-`Dog.prototype` should be an instance of `Animal`.
+`Dog.prototype` deve ser uma instância de `Animal`.
 
 ```js
 assert(Animal.prototype.isPrototypeOf(Dog.prototype));
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
index b9d96a71ec..d3468c1f48 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dae367417b2b2512b7b
-title: Understand Own Properties
+title: Entendendo Propriedades Próprias
 challengeType: 1
 forumTopicId: 301326
 dashedName: understand-own-properties
@@ -8,7 +8,7 @@ dashedName: understand-own-properties
 
 # --description--
 
-In the following example, the `Bird` constructor defines two properties: `name` and `numLegs`:
+No próximo exemplo, o construtor de `Bird` define duas propriedades: `name` e `numLegs`:
 
 ```js
 function Bird(name) {
@@ -20,7 +20,7 @@ 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`:
+`name` e `numLegs` são chamados <dfn>own properties</dfn>, pois são definidos diretamente na instância do objeto. Isso significa que cada `duck` e `canary` possuem suas próprias cópias separadas destas propriedades. Na verdade, toda instância de `Bird` terá sua própria cópia dessas propriedades. O código a seguir adiciona todas as propriedades próprias (own properties) de `duck` para o array `ownProps`:
 
 ```js
 let ownProps = [];
@@ -34,27 +34,27 @@ for (let property in duck) {
 console.log(ownProps);
 ```
 
-The console would display the value `["name", "numLegs"]`.
+O console irá exibir o valor `["name", "numLegs"]`.
 
 # --instructions--
 
-Add the own properties of `canary` to the array `ownProps`.
+Adicione as propriedades próprias do `canary` para o array `ownProps`.
 
 # --hints--
 
-`ownProps` should include the values `numLegs` and `name`.
+`ownProps` deve incluir os valores `numLegs` e `name`.
 
 ```js
 assert(ownProps.indexOf('name') !== -1 && ownProps.indexOf('numLegs') !== -1);
 ```
 
-You should solve this challenge without using the built in method `Object.keys()`.
+Você deve resolver este desafio sem utilizar o método nativo `Object.keys()`.
 
 ```js
 assert(!/Object(\.keys|\[(['"`])keys\2\])/.test(code));
 ```
 
-You should solve this challenge without hardcoding the `ownProps` array.
+Você deve resolver este desafio sem definir o array `ownProps` de forma fixa no código.
 
 ```js
 assert(
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
index 17b2bf8359..305aad0896 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7daf367417b2b2512b7e
-title: Understand the Constructor Property
+title: Entendendo a Propriedade Construtora
 challengeType: 1
 forumTopicId: 301327
 dashedName: understand-the-constructor-property
@@ -8,7 +8,7 @@ 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:
+Tem uma propriedade especial do `construtor` localizada nas instâncias dos objetos `duck` e `beagle` que foram criados nos desafios anteriores:
 
 ```js
 let duck = new Bird();
@@ -18,9 +18,9 @@ console.log(duck.constructor === Bird);
 console.log(beagle.constructor === Dog);
 ```
 
-Both of these `console.log` calls would display `true` in the console.
+Ambas as chamadas a `console.log` irão exibir `true` no 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:
+Note que a propriedade `construtor` é uma referência a função construtora que criou a instância. A vantagem da propriedade `construtor` é que se torna possível verificar essa propriedade para descobrir qual o tipo do objeto. Aqui está um exemplo de como isso poderia ser utilizado:
 
 ```js
 function joinBirdFraternity(candidate) {
@@ -32,27 +32,27 @@ function joinBirdFraternity(candidate) {
 }
 ```
 
-**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.
+**Note:** Desde que a propriedade `construtor` pode ser sobrescrita (o que será abordado nos próximos dois desafios), geralmente é melhor utilizar o método `instanceof` para verificar o tipo de um objeto.
 
 # --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`.
+Escreva a função `joinDogFraternity` que recebe o parâmetro `candidate` e, utilizando a propriedade `construtora`, retorne `true` se o candidato é um `Dog`, e caso não seja, retorne `false`.
 
 # --hints--
 
-`joinDogFraternity` should be defined as a function.
+`joinDogFraternity` deve ser definido como uma função.
 
 ```js
 assert(typeof joinDogFraternity === 'function');
 ```
 
-`joinDogFraternity` should return `true` if `candidate` is an instance of `Dog`.
+`joinDogFraternity` deve retornar `true` se `candidate` for uma instância de `Dog`.
 
 ```js
 assert(joinDogFraternity(new Dog('')) === true);
 ```
 
-`joinDogFraternity` should use the `constructor` property.
+`joinDogFraternity` deve utilizar a propriedade `construtor`.
 
 ```js
 assert(/\.constructor/.test(code) && !/instanceof/.test(code));
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
index 67ebe4d0e7..2563a379e0 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db2367417b2b2512b8b
-title: Understand the Immediately Invoked Function Expression (IIFE)
+title: Entenda a Expressão de Função Invocada Imediatamente (IIFE)
 challengeType: 1
 forumTopicId: 301328
 dashedName: understand-the-immediately-invoked-function-expression-iife
@@ -8,7 +8,7 @@ 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:
+Um padrão comum em JavaScript é executar a função assim que ela é declarada:
 
 ```js
 (function () {
@@ -16,23 +16,23 @@ A common pattern in JavaScript is to execute a function as soon as it is declare
 })();
 ```
 
-This is an anonymous function expression that executes right away, and outputs `Chirp, chirp!` immediately.
+Essa é uma expressão de função anônima que executa logo após ser declarada, e exibe imediatamente no console `Chirp, chirp!`.
 
-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>.
+Note que a função não possui nome e não é armazenada em uma variável. Os dois parênteses () ao final da expressão da função faz com que ela seja imediatamente executada ou invocada. Este padrão é conhecido como <dfn>immediately invoked function expression (expressão de função invocada imediatamente)</dfn> ou <dfn>IIFE</dfn>.
 
 # --instructions--
 
-Rewrite the function `makeNest` and remove its call so instead it's an anonymous immediately invoked function expression (IIFE).
+Rescreva a função `makeNest` e remova a chamada a ela para que no lugar seja uma expressão de função anônima imediatamente invocada (IIFE).
 
 # --hints--
 
-The function should be anonymous.
+A função deve ser anônima.
 
 ```js
 assert(/\((function|\(\))(=>|\(\)){?/.test(code.replace(/\s/g, '')));
 ```
 
-Your function should have parentheses at the end of the expression to call it immediately.
+Sua função deve ter parênteses no final da expressão para chamar ela imediatamente.
 
 ```js
 assert(/\(.*(\)\(|\}\(\))\)/.test(code.replace(/[\s;]/g, '')));
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
index 1ee203a745..f9b15e5e03 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db0367417b2b2512b82
-title: Understand the Prototype Chain
+title: Entenda o Protótipo Cadeia
 challengeType: 1
 forumTopicId: 301329
 dashedName: understand-the-prototype-chain
@@ -8,7 +8,7 @@ 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.
+Todos os objetos em JavaScript (com algumas exceções) possuem um `prototype`. Além de que, um `prototype` de um objeto ser um próprio objeto.
 
 ```js
 function Bird(name) {
@@ -18,28 +18,28 @@ function Bird(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`:
+Devido ao fato de um `prototype` ser um objeto, um `prototype` pode ter seu próprio `prototype`! Neste caso, o `prototype` de `Bird.prototype` é um `Object.prototype`:
 
 ```js
 Object.prototype.isPrototypeOf(Bird.prototype);
 ```
 
-How is this useful? You may recall the `hasOwnProperty` method from a previous challenge:
+Como isso é útil? Você pode ser lembrar que o método `hasOwnProperty` do desafio anterior:
 
 ```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.
+O método `hasOwnProperty` é definido em `Object.prototype`, o qual pode ser acessado por `Bird.prototype`, o qual pode ser acessado por `duck`. Este é um exemplo de cadeia de `prototype`. Nesta cadeia de `prototype`, `Bird` é um `supertipo` para `duck`, enquanto `duck` é o `subtipo`. `Object` é um `supertipo` para ambos `Bird` e `duck`. `Object` é um `supertipo` para todos os objetos em JavaScript. Desta forma, qualquer objeto pode utilizar o método `hasOwnProperty`.
 
 # --instructions--
 
-Modify the code to show the correct prototype chain.
+Modifique o código para mostrar corretamente a cadeia de protótipo.
 
 # --hints--
 
-Your code should show that `Object.prototype` is the prototype of `Dog.prototype`
+Seu código deve mostrar que `Object.prototype` é o protótipo de `Dog.prototype`
 
 ```js
 assert(/Object\.prototype\.isPrototypeOf/.test(code));
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
index ce7ed680ff..e496e3b4b0 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db0367417b2b2512b81
-title: Understand Where an Object’s Prototype Comes From
+title: Entenda de Onde Vem o Protótipo de um Objeto
 challengeType: 1
 forumTopicId: 301330
 dashedName: understand-where-an-objects-prototype-comes-from
@@ -8,7 +8,7 @@ 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:
+Assim como uma pessoa herda o gene de seus parentes, um objeto herda seu `prototype` diretamente da função construtora que o criou. Por exemplo, aqui o construtor de `Bird` cria um objeto `duck`:
 
 ```js
 function Bird(name) {
@@ -18,21 +18,21 @@ function Bird(name) {
 let duck = new Bird("Donald");
 ```
 
-`duck` inherits its `prototype` from the `Bird` constructor function. You can show this relationship with the `isPrototypeOf` method:
+`duck` herda seu `prototype` da função construtora de `Bird`. Você pode mostrar a relação com o método `isPrototypeOf`:
 
 ```js
 Bird.prototype.isPrototypeOf(duck);
 ```
 
-This would return `true`.
+Isso iria retornar `true`.
 
 # --instructions--
 
-Use `isPrototypeOf` to check the `prototype` of `beagle`.
+Utilize `isPrototypeOf` para verificar o `prototype` de `beagle`.
 
 # --hints--
 
-You should show that `Dog.prototype` is the `prototype` of `beagle`
+Você deve mostrar que o `Dog.prototype` é um `protótipo` de `beagle`
 
 ```js
 assert(/Dog\.prototype\.isPrototypeOf\(beagle\)/.test(code));
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
index 122fcb9a59..be6cbbe79c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dad367417b2b2512b78
-title: Use a Constructor to Create Objects
+title: Utilize um Construtor para Criar Objetos
 challengeType: 1
 forumTopicId: 18233
 dashedName: use-a-constructor-to-create-objects
@@ -8,7 +8,7 @@ dashedName: use-a-constructor-to-create-objects
 
 # --description--
 
-Here's the `Bird` constructor from the previous challenge:
+Aqui está o construtor de `Bird` do desafio anterior:
 
 ```js
 function Bird() {
@@ -20,9 +20,9 @@ function Bird() {
 let blueBird = new Bird();
 ```
 
-**NOTE:** `this` inside the constructor always refers to the object being created.
+**Note:** `this` dentro do construtor sempre refere-se ao objeto sendo criado.
 
-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:
+Note que o operador `new` é usado quando chamamos o construtor. Isso avisa ao JavaScript para criar uma nova instância de `Bird` chamado `blueBird`. Sem o operador `new`, `this` dentro do construtor não iria apontar para o objeto recentemente criado, dando resultados inesperados. Agora `blueBird` possui todas as propriedades definidas dentro do construtor `Bird`:
 
 ```js
 blueBird.name;
@@ -30,7 +30,7 @@ blueBird.color;
 blueBird.numLegs;
 ```
 
-Just like any other object, its properties can be accessed and modified:
+Assim como qualquer outro objeto, suas propriedades podem ser acessadas e modificadas:
 
 ```js
 blueBird.name = 'Elvira';
@@ -39,17 +39,17 @@ blueBird.name;
 
 # --instructions--
 
-Use the `Dog` constructor from the last lesson to create a new instance of `Dog`, assigning it to a variable `hound`.
+Utilize o construtor de `Dog` da última lição para criar uma nova instância de `Dog`, atribuindo a instância para a variável `hound`.
 
 # --hints--
 
-`hound` should be created using the `Dog` constructor.
+`hound` deve ser criado utilizando o construtor `Dog`.
 
 ```js
 assert(hound instanceof Dog);
 ```
 
-Your code should use the `new` operator to create an instance of `Dog`.
+Seu código deve utilizar o operador `new` para criar uma instância de `Dog`.
 
 ```js
 assert(code.match(/new/g));
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
index d4d627fbc8..d8f6bf9ace 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db2367417b2b2512b89
-title: Use a Mixin to Add Common Behavior Between Unrelated Objects
+title: Utilize Mixin para Adicionar Comportamentos Comuns Entre Objetos Não-Relacionados
 challengeType: 1
 forumTopicId: 301331
 dashedName: use-a-mixin-to-add-common-behavior-between-unrelated-objects
@@ -8,9 +8,9 @@ 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.
+Como você já viu, comportamento é compartilhado através de herança. Porém, existem casos em que a herança não é a melhor solução. Herança não funciona muito bem para objetos não-relacionados como `Bird` e `Airplane`. Ambos podem voar, mas um `Bird` não é um tipo de `Airplane` e vice versa.
 
-For unrelated objects, it's better to use <dfn>mixins</dfn>. A mixin allows other objects to use a collection of functions.
+Para objetos não-relacionados, é melhor usar <dfn>mixins</dfn>. Um mixin permite outros objetos para utilizar uma coleção de funções.
 
 ```js
 let flyMixin = function(obj) {
@@ -20,7 +20,7 @@ let flyMixin = function(obj) {
 };
 ```
 
-The `flyMixin` takes any object and gives it the `fly` method.
+O `flyMixin` recebe qualquer objeto e da a ele o método `fly`.
 
 ```js
 let bird = {
@@ -37,36 +37,36 @@ 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:
+Aqui `bird` e `plane` são passados para `flyMixin`, o que em seguida atribui a função `fly` para cada objeto. Agora `bird` e `plane` podem ambos voar:
 
 ```js
 bird.fly();
 plane.fly();
 ```
 
-The console would display the string `Flying, wooosh!` twice, once for each `.fly()` call.
+O console irá mostrar a string `Flying, woosh!` duas vezes, uma para cada chamada a `.fly()`.
 
-Note how the mixin allows for the same `fly` method to be reused by unrelated objects `bird` and `plane`.
+Note como o mixin permite que o mesmo método `fly` seja reutilizado por objetos não-relacionados `bird` e `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.
+Crie um mixin chamado `glideMixin` que define o método chamado `glide`. Em seguida, use `glideMixin` para dar ambos `bird` e `boat` a habilidade de deslizar (glide).
 
 # --hints--
 
-Your code should declare a `glideMixin` variable that is a function.
+Seu código deve declarar a variável `glideMixin`, a qual é uma função.
 
 ```js
 assert(typeof glideMixin === 'function');
 ```
 
-Your code should use the `glideMixin` on the `bird` object to give it the `glide` method.
+Seu código deve utilizar o `glideMixin` no objeto `bird` para dar ao objeto o método `glide`.
 
 ```js
 assert(typeof bird.glide === 'function');
 ```
 
-Your code should use the `glideMixin` on the `boat` object to give it the `glide` method.
+Seu código deve utilizar `glideMixin` no objeto `boat` para dar ao objeto o método `glide`.
 
 ```js
 assert(typeof boat.glide === 'function');
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
index ba842fa313..454b4511dc 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db2367417b2b2512b8c
-title: Use an IIFE to Create a Module
+title: Utilize um IIFE para Criar um Módulo
 challengeType: 1
 forumTopicId: 301332
 dashedName: use-an-iife-to-create-a-module
@@ -8,7 +8,7 @@ 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:
+Uma expressão de função imediatamente invocada (IIFE) é frequentemente utilizado para agrupar funcionalidades relacionadas para um único objeto ou <dfn>module</dfn>. Por exemplo, um desafio anterior definiu dois mixins:
 
 ```js
 function glideMixin(obj) {
@@ -23,7 +23,7 @@ function flyMixin(obj) {
 }
 ```
 
-We can group these mixins into a module as follows:
+Nos podemos agrupar esses mixins em um módulo como o seguinte:
 
 ```js
 let motionModule = (function () {
@@ -42,7 +42,7 @@ let motionModule = (function () {
 })();
 ```
 
-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:
+Note que você possui uma expressão de função imediatamente invocada (IIFE) que retorna um objeto `motionModule`. Esse objeto retornado contém todos os comportamentos de mixin como propriedades do objeto. A vantagem do padrão módulo é que todos os comportamentos de movimento podem ser embalados em um único objeto que pode em seguida ser usado por outras partes do seu código. Aqui está um exemplo utilizando isso:
 
 ```js
 motionModule.glideMixin(duck);
@@ -51,23 +51,23 @@ duck.glide();
 
 # --instructions--
 
-Create a module named `funModule` to wrap the two mixins `isCuteMixin` and `singMixin`. `funModule` should return an object.
+Crie um módulo chamado `funModule` para embrulhar os dois mixins `isCuteMixin` e `singMixin`. `funModule` deve retornar um objeto.
 
 # --hints--
 
-`funModule` should be defined and return an object.
+`funModule` deve ser definido e retornar um objeto.
 
 ```js
 assert(typeof funModule === 'object');
 ```
 
-`funModule.isCuteMixin` should access a function.
+`funModule.isCuteMixin` deve acessar uma função.
 
 ```js
 assert(typeof funModule.isCuteMixin === 'function');
 ```
 
-`funModule.singMixin` should access a function.
+`funModule.singMixin` deve acessar uma função.
 
 ```js
 assert(typeof funModule.singMixin === 'function');
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
index 8441ee648a..d714621f37 100644
--- 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
@@ -1,7 +1,7 @@
 ---
 id: 587d7db2367417b2b2512b8a
 title: >-
-  Use Closure to Protect Properties Within an Object from Being Modified Externally
+  Use Fecho para Proteger Propriedades Dentro de um Objeto de Serem Modificados Externamente
 challengeType: 1
 forumTopicId: 18234
 dashedName: >-
@@ -10,15 +10,15 @@ dashedName: >-
 
 # --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.
+No desafio anterior, `bird` possuía uma propriedade pública `name`. É considerado publico porque ele pode ser acessado e modificado fora da definição de `bird`.
 
 ```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.
+Portanto, qualquer parte do seu código pode facilmente alterar o nome do `bird` para qualquer valor. Pense sobre coisas como senhas e contas de banco sendo facilmente modificáveis em qualquer parte do seu código. Isso poderia causar inúmeros problemas.
 
-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.
+A forma mais simples para tornar essa propriedade pública em privada, seria criando uma variável dentro da função constructor. Isso alteraria o escopo daquela variável para ser apenas o escopo da função construtora ao invés de globalmente disponível. Dessa maneira, a variável pode ser acessada e modificada apenas pelos métodos dentro da função construtora.
 
 ```js
 function Bird() {
@@ -32,27 +32,27 @@ 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`.
+Aqui `getHatchedEggCount` é um método privilegiado, porque ele possui acesso à variável privada `hatchedEgg`. Isso é possível porque `hatchedEgg` é declarado no mesmo contexto que `getHatchedEggCount`. Em JavaScript, a função sempre possui acesso ao contexto na qual foi criada. Isso é chamado de `closure(fecho)`.
 
 # --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.
+Modifique como `weight` é declarado na função `Bird` para que seja uma variável privada. Em seguida, crie o método `getWeight` que retorna o valor de `weight` 15.
 
 # --hints--
 
-The `weight` property should be a private variable and should be assigned the value of `15`.
+A propriedade `weight` deve ser uma variável privada e deve ser atribuída a ela o valor `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`.
+Seu código deve criar o método dentro de `Bird` chamado `getWeight` que retorna o valor da variável privada `weight`.
 
 ```js
 assert(new Bird().getWeight() === 15);
 ```
 
-Your `getWeight` function should return the private variable `weight`.
+Sua função `getWeight` deve retornar a variável privada `weight`.
 
 ```js
 assert(code.match(/((return\s+)|(\(\s*\)\s*\=\>\s*))weight\;?/g));
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
index c2a6b1700b..fae522cc47 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dac367417b2b2512b74
-title: Use Dot Notation to Access the Properties of an Object
+title: Use Ponto Notação para Acessar as Propriedades de um Objeto
 challengeType: 1
 forumTopicId: 301333
 dashedName: use-dot-notation-to-access-the-properties-of-an-object
@@ -8,7 +8,7 @@ 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:
+O último desafio criou um objeto com várias propriedades. Agora você verá como acessar os valores dessas propriedades. Aqui está um exemplo:
 
 ```js
 let duck = {
@@ -18,21 +18,21 @@ let duck = {
 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`.
+Ponto notação é utilizado no nome do objeto, `duck`, seguido pelo nome da propriedade, `name`, para acessar o valor de `Aflac`.
 
 # --instructions--
 
-Print both properties of the `dog` object to your console.
+Exiba ambas as propriedades do objeto `dog` no seu console.
 
 # --hints--
 
-Your code should use `console.log` to print the value for the `name` property of the `dog` object.
+Seu código deve usar `console.log` para exibir o valor da propriedade `name` do objeto `dog`.
 
 ```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.
+Seu código deve usar `console.log` para exibir o valor para a propriedade `numLegs` do objeto `dog`.
 
 ```js
 assert(/console.log\(.*dog\.numLegs.*\)/g.test(code));
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
index 4411c1a12e..cc3285c554 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db0367417b2b2512b83
-title: Use Inheritance So You Don't Repeat Yourself
+title: Utilize Herança Para Que Você Não Repita Código Você Mesmo
 challengeType: 1
 forumTopicId: 301334
 dashedName: use-inheritance-so-you-dont-repeat-yourself
@@ -8,9 +8,9 @@ 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.
+Tem um princípio da programação chamado <dfn>Don't Repeat Yourself (DRY) (Não Repita Você Mesmo)</dfn>. O motivo pelo qual código repetido é um problema se deve ao fato de qualquer alteração exige correção de código em vários locais. Geralmente isso significa mais trabalho para os programadores e mais espaço para erros.
 
-Notice in the example below that the `describe` method is shared by `Bird` and `Dog`:
+Note que o exemplo abaixo que `descreve` o método é compartilhado por `Bird` e `Dog`:
 
 ```js
 Bird.prototype = {
@@ -28,7 +28,7 @@ Dog.prototype = {
 };
 ```
 
-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`:
+O método `describe` é repetido em dois locais. O código pode ser editado para seguir o princípio DRY (Não Repita Você Mesmo) ao criar um `supertipo` (ou parente) chamado `Animal`:
 
 ```js
 function Animal() { };
@@ -41,7 +41,7 @@ Animal.prototype = {
 };
 ```
 
-Since `Animal` includes the `describe` method, you can remove it from `Bird` and `Dog`:
+Desde que `Animal` inclui o método `describe`, você pode remover ele de `Bird` e `Dog`:
 
 ```js
 Bird.prototype = {
@@ -55,23 +55,23 @@ Dog.prototype = {
 
 # --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`.
+O método `eat` é repetido em `Cat` e `Bear`. Edite o código no espírito do princípio DRY ao mover o método `eat` do `supertipo` de `Animal`.
 
 # --hints--
 
-`Animal.prototype` should have the `eat` property.
+`Animal.prototype` deve ter a propriedade `eat`.
 
 ```js
 assert(Animal.prototype.hasOwnProperty('eat'));
 ```
 
-`Bear.prototype` should not have the `eat` property.
+`Bear.prototype` não deve ter a propriedade `eat`.
 
 ```js
 assert(!Bear.prototype.hasOwnProperty('eat'));
 ```
 
-`Cat.prototype` should not have the `eat` property.
+`Cat.propotype` não deve ter a propriedade `eat`.
 
 ```js
 assert(!Cat.prototype.hasOwnProperty('eat'));
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
index 7d18dd43b9..fc8fc11b46 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dae367417b2b2512b7c
-title: Use Prototype Properties to Reduce Duplicate Code
+title: Use Propriedades de Protótipos para Reduzir Código Duplicado
 challengeType: 1
 forumTopicId: 301336
 dashedName: use-prototype-properties-to-reduce-duplicate-code
@@ -8,44 +8,44 @@ 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.
+Já que `numLegs` provavelmente terá o mesmo valor para todas as instâncias de `Bird`, você tem a variável `numLegs` duplicada dentro de cada instância de `Bird`.
 
-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.
+Isso pode não ser um problema quando há apenas duas instâncias, mas imagine se há milhões de instâncias. Neste cenário teríamos muitas variáveis duplicadas.
 
-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`:
+Uma maneira melhor é usar o `prototype` de `Bird`. Propriedades dentro de `prototype` são compartilhados entre todas as instâncias de `Bird`. Aqui está como adicionar `numLegs` para o `prototype` de `Bird`:
 
 ```js
 Bird.prototype.numLegs = 2;
 ```
 
-Now all instances of `Bird` have the `numLegs` property.
+Agora todas as instâncias de `Bird` possuem a propriedade `numLegs`.
 
 ```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.
+Já que todas as instâncias automaticamente possuem as propriedades no `prototype`, pense no `prototype` como uma "receita" para criar objetos. Note que o `prototype` para `duck` e `canary` faz parte do construtor de `Bird` como `Bird.prototype`. Quase todos objetos em JavaScript possuem a propriedade `prototype` o qual é parte da função construtora que o criou.
 
 # --instructions--
 
-Add a `numLegs` property to the `prototype` of `Dog`
+Adicione a propriedade `numLegs` para o `prototype` de `Dog`
 
 # --hints--
 
-`beagle` should have a `numLegs` property.
+`beagle` deve ter a propriedade `numLegs`.
 
 ```js
 assert(beagle.numLegs !== undefined);
 ```
 
-`beagle.numLegs` should be a number.
+`beagle.numLegs` deve ser um número.
 
 ```js
 assert(typeof beagle.numLegs === 'number');
 ```
 
-`numLegs` should be a `prototype` property not an own property.
+`numLegs` deve ser uma propriedade `prototype` e não uma propriedade própria (own property).
 
 ```js
 assert(beagle.hasOwnProperty('numLegs') === false);
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
index 232e29ed51..ee8a3801d5 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dae367417b2b2512b7a
-title: Verify an Object's Constructor with instanceof
+title: Verifique o Construtor de um Objeto com instanceof
 challengeType: 1
 forumTopicId: 301337
 dashedName: verify-an-objects-constructor-with-instanceof
@@ -8,7 +8,7 @@ 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:
+Toda vez que a função construtora cria um novo objeto, o objeto é definido como uma <dfn>instance</dfn> do seu construtor. JavaScript provê uma forma conveniente para verificar isso com o operador `instanceof`. `instanceof` permite que você compare um objeto a um construtor, retornando `true` ou `false` caso seja ou não um objeto criado pelo construtor, respectivamente. Aqui está um exemplo:
 
 ```js
 let Bird = function(name, color) {
@@ -22,9 +22,9 @@ let crow = new Bird("Alexis", "black");
 crow instanceof Bird;
 ```
 
-This `instanceof` method would return `true`.
+Este método `instanceof` irá retornar `true`.
 
-If an object is created without using a constructor, `instanceof` will verify that it is not an instance of that constructor:
+Se um objeto for criado sem usar um construtor, `instanceof` verificará que não é uma instância daquele construtor:
 
 ```js
 let canary = {
@@ -36,21 +36,21 @@ let canary = {
 canary instanceof Bird;
 ```
 
-This `instanceof` method would return `false`.
+Este método `instanceof` irá retornar `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`.
+Crie uma nova instância do construtor `House`, atribuindo à variável `myHouse` e passe o número de quartos. Então, utilize `instanceof` para verificar que é uma instância de `House`.
 
 # --hints--
 
-`myHouse` should have a `numBedrooms` attribute set to a number.
+`myHouse` deve ter o atributo `numBedrooms` definido para um número.
 
 ```js
 assert(typeof myHouse.numBedrooms === 'number');
 ```
 
-You should verify that `myHouse` is an instance of `House` using the `instanceof` operator.
+Você deve verificar que `myHouse` é uma instância de `House` utilizando o operador `instanceof`.
 
 ```js
 assert(/myHouse\s*instanceof\s*House/.test(code));
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
index 8bed443ac0..0e7dde0ba7 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dba367417b2b2512ba8
-title: Check for All or None
+title: Verificando existência
 challengeType: 1
 forumTopicId: 301338
 dashedName: check-for-all-or-none
@@ -8,11 +8,11 @@ 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.
+Haverá vezes em que você procurará padrões que podem ou não existir na string. Pode ser relevante validá-los dependendo da situação.
 
-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.
+Você pode fazer com que um padrão seja opcional ao usar uma interrogação, `?`, depois dele. Ela valida se há uma ou nenhuma ocorrência do padrão. Pode-se dizer que a interrogação torna o elemento à esquerda dela opcional.
 
-For example, there are slight differences in American and British English and you can use the question mark to match both spellings.
+Por exemplo, com a interrogação você pode capturar palavras em inglês escritas com a ortografia americana ou britânica.
 
 ```js
 let american = "color";
@@ -22,36 +22,36 @@ rainbowRegex.test(american);
 rainbowRegex.test(british);
 ```
 
-Both uses of the `test` method would return `true`.
+Ambas as chamadas ao método `test` retornam `true`.
 
 # --instructions--
 
-Change the regex `favRegex` to match both the American English (`favorite`) and the British English (`favourite`) version of the word.
+Altere a regex `favRegex` para encontrar as versões americana (`favorite`) e britânica (`favourite`) da palavra.
 
 # --hints--
 
-Your regex should use the optional symbol, `?`.
+Sua regex deve usar a interrogação (`?`) para validação opcional.
 
 ```js
 favRegex.lastIndex = 0;
 assert(favRegex.source.match(/\?/).length > 0);
 ```
 
-Your regex should match the string `favorite`
+Sua regex deve encontrar a string `favorite`
 
 ```js
 favRegex.lastIndex = 0;
 assert(favRegex.test('favorite'));
 ```
 
-Your regex should match the string `favourite`
+Sua regex deve encontrar a string `favourite`
 
 ```js
 favRegex.lastIndex = 0;
 assert(favRegex.test('favourite'));
 ```
 
-Your regex should not match the string `fav`
+Sua regex não deve encontrar a string `fav`
 
 ```js
 favRegex.lastIndex = 0;
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
index 6f388d1462..86f5397386 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 5c3dda8b4d8df89bea71600f
-title: Check For Mixed Grouping of Characters
+title: Validando Grupos Mistos de Caracteres
 challengeType: 1
 forumTopicId: 301339
 dashedName: check-for-mixed-grouping-of-characters
@@ -8,11 +8,11 @@ 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 `()`.
+Há vezes em que queremos validar grupos de caracteres em uma expressão regular. É possível fazê-lo usando parênteses: `()`.
 
-If you want to find either `Penguin` or `Pumpkin` in a string, you can use the following Regular Expression: `/P(engu|umpk)in/g`
+Você pode usar a expressão regular `/P(engu|umpk)in/g` para encontrar tanto `Penguin` quanto `Pumpkin` em uma string.
 
-Then check whether the desired string groups are in the test string by using the `test()` method.
+Depois é só usar o método `test()` para verificar se os grupos estão presentes na string.
 
 ```js
 let testStr = "Pumpkin";
@@ -20,51 +20,51 @@ let testRegex = /P(engu|umpk)in/;
 testRegex.test(testStr);
 ```
 
-The `test` method here would return `true`.
+O método `test` retorna `true` aqui.
 
 # --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.
+Corrija a regex para que ela valide os nomes `Franklin Roosevelt` e `Eleanor Roosevelt` levando em conta maiúsculas e minúsculas. A regex também deve permitir nomes do meio.
 
-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.
+Depois corrija o código, fazendo com que a regex seja testada na string `myString`, retornando `true` ou `false`.
 
 # --hints--
 
-Your regex `myRegex` should return `true` for the string `Franklin D. Roosevelt`
+Sua regex `myRegex` deve retornar `true` para a 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`
+Sua regex `myRegex` deve retornar `true` para a string `Eleanor Roosevelt`
 
 ```js
 myRegex.lastIndex = 0;
 assert(myRegex.test('Eleanor Roosevelt'));
 ```
 
-Your regex `myRegex` should return `false` for the string `Franklin Rosevelt`
+Sua regex `myRegex` deve retornar `false` para a string `Franklin Rosevelt`
 
 ```js
 myRegex.lastIndex = 0;
 assert(!myRegex.test('Franklin Rosevelt'));
 ```
 
-Your regex `myRegex` should return `false` for the string `Frank Roosevelt`
+Sua regex `myRegex` deve retornar `false` para a string `Frank Roosevelt`
 
 ```js
 myRegex.lastIndex = 0;
 assert(!myRegex.test('Frank Roosevelt'));
 ```
 
-You should use `.test()` to test the regex.
+Você deve usar `.test()` para testar a regex.
 
 ```js
 assert(code.match(/myRegex.test\(\s*myString\s*\)/));
 ```
 
-Your result should return `true`.
+O resultado deve ser `true`.
 
 ```js
 assert(result === true);
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
index 887f6e3629..b5c073d8ab 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db4367417b2b2512b92
-title: Extract Matches
+title: Extraindo Resultados
 challengeType: 1
 forumTopicId: 301340
 dashedName: extract-matches
@@ -8,11 +8,11 @@ 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.
+Até agora, você só tem verificado se existe ou não um padrão dentro de uma string. Você também pode extrair os resultados encontrados por meio do método `.match()`.
 
-To use the `.match()` method, apply the method on a string and pass in the regex inside the parentheses.
+Para usar o método `.match()`, aplique o método em uma string e passe a regex dentro dos parênteses.
 
-Here's an example:
+Um exemplo:
 
 ```js
 "Hello, World!".match(/Hello/);
@@ -21,9 +21,9 @@ let ourRegex = /expressions/;
 ourStr.match(ourRegex);
 ```
 
-Here the first `match` would return `["Hello"]` and the second would return `["expressions"]`.
+Aqui, o primeiro `match` retorna `["Hello"]` e, o segundo, `["expressions"]`.
 
-Note that the `.match` syntax is the "opposite" of the `.test` method you have been using thus far:
+Note que o método `.match` se usa de forma "contrária" ao método `.test` que você usou até então:
 
 ```js
 'string'.match(/regex/);
@@ -32,23 +32,23 @@ Note that the `.match` syntax is the "opposite" of the `.test` method you have b
 
 # --instructions--
 
-Apply the `.match()` method to extract the string `coding`.
+Aplique o método `.match()` para extrair a string `coding`.
 
 # --hints--
 
-The `result` should have the string `coding`
+O resultado, `result`, deve conter a string `coding`
 
 ```js
 assert(result.join() === 'coding');
 ```
 
-Your regex `codingRegex` should search for the string `coding`
+Sua regex `codingRegex` deve buscar a string `coding`
 
 ```js
 assert(codingRegex.source === 'coding');
 ```
 
-You should use the `.match()` method.
+Você deve usar o método `.match()`.
 
 ```js
 assert(code.match(/\.match\(.*\)/));
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
index a4dfbbf1d1..7113a2ca4a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db6367417b2b2512b9b
-title: Find Characters with Lazy Matching
+title: Encontre Caracteres com Captura Preguiçosa
 challengeType: 1
 forumTopicId: 301341
 dashedName: find-characters-with-lazy-matching
@@ -8,35 +8,35 @@ 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.
+Em expressões regulares, uma captura <dfn>gananciosa</dfn> encontra a parte mais longa o possível de uma string em que a regex atua e a retorna como resultado. A alternativa se chama captura <dfn>preguiçosa</dfn> e ela encontra o menor pedaço o possível de uma string que satisfaz a regex.
 
-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.
+Você pode aplicar a regex `/t[a-z]*i/` à string `"titanic"`. Essa regex é basicamente um padrão que começa com `t`, termina com `i`e tem algumas letras no meio delas.
 
-Regular expressions are by default greedy, so the match would return `["titani"]`. It finds the largest sub-string possible to fit the pattern.
+Expressões regulares são gananciosas por padrão, então o resultado seria `["titani"]`. Ou seja, a maior string o possível que atende ao padrão é encontrada.
 
-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"]`.
+Mas você pode usar o caractere `?` para torná-la preguiçosa. Aplicar a regex adaptada `/t[a-z]*?i/` à string `"titanic"` retorna `["ti"]`.
 
-**Note:** Parsing HTML with regular expressions should be avoided, but pattern matching an HTML string with regular expressions is completely fine.
+**Obs:** Ler HTML com expressões regulares deve ser evitado, mas procurar uma string HTML usando expressões regulares é perfeitamente aceitável.
 
 # --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.
+Arrume a regex `/<.*>/` para que retorne a tag HTML `<h1>` mas não a linha `"<h1>Winter is coming</h1>"`. Lembre-se de que o caractere curinga `.` em uma expressão regular captura qualquer caractere.
 
 # --hints--
 
-The `result` variable should be an array with `<h1>` in it
+A variável `result` deve ser um array contendo `<h1>`
 
 ```js
 assert(result[0] == '<h1>');
 ```
 
-`myRegex` should use lazy matching
+`myRegex` deve ser preguiçosa
 
 ```js
 assert(/\?/g.test(myRegex));
 ```
 
-`myRegex` should not include the string `h1`
+`myRegex` não deve incluir a string `h1`
 
 ```js
 assert(!myRegex.source.match('h1'));
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
index e9e55893d6..a5a53630af 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db4367417b2b2512b93
-title: Find More Than the First Match
+title: Encontre Mais do que o Primeiro Resultado
 challengeType: 1
 forumTopicId: 301342
 dashedName: find-more-than-the-first-match
@@ -8,7 +8,7 @@ dashedName: find-more-than-the-first-match
 
 # --description--
 
-So far, you have only been able to extract or search a pattern once.
+Até agora você foi capaz apenas de extrair ou buscar um resultado de uma vez.
 
 ```js
 let testStr = "Repeat, Repeat, Repeat";
@@ -16,39 +16,39 @@ let ourRegex = /Repeat/;
 testStr.match(ourRegex);
 ```
 
-Here `match` would return `["Repeat"]`.
+`match` retorna `["Repeat"]` aqui.
 
-To search or extract a pattern more than once, you can use the `g` flag.
+Para buscar ou extrair um padrão além do primeiro resultado, você pode usar a flag `g` (de "global").
 
 ```js
 let repeatRegex = /Repeat/g;
 testStr.match(repeatRegex);
 ```
 
-And here `match` returns the value `["Repeat", "Repeat", "Repeat"]`
+Aqui, `match` retorna o valor `["Repeat", "Repeat", "Repeat"]`
 
 # --instructions--
 
-Using the regex `starRegex`, find and extract both `Twinkle` words from the string `twinkleStar`.
+Usando a regex `starRegex`, encontre e extraia ambas ocorrências da palavra `Twinkle` da string `twinkleStar`.
 
-**Note**  
-You can have multiple flags on your regex like `/search/gi`
+**Obs:**  
+Você pode usar múltiplas flags em uma regex: `/search/gi`
 
 # --hints--
 
-Your regex `starRegex` should use the global flag `g`
+Sua regex `starRegex` deve usar a flag `g`
 
 ```js
 assert(starRegex.flags.match(/g/).length == 1);
 ```
 
-Your regex `starRegex` should use the case insensitive flag `i`
+Sua regex `starRegex` deve usar a flag de ignorar caixa, `i`
 
 ```js
 assert(starRegex.flags.match(/i/).length == 1);
 ```
 
-Your match should match both occurrences of the word `Twinkle`
+Seu resultado deve conter ambas as ocorrências da palavra `Twinkle`
 
 ```js
 assert(
@@ -60,7 +60,7 @@ assert(
 );
 ```
 
-Your match `result` should have two elements in it.
+Seu resultado, `result`, deve conter dois elementos.
 
 ```js
 assert(result.length == 2);
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
index 553c581b89..62443d6bdf 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db7367417b2b2512b9c
-title: Find One or More Criminals in a Hunt
+title: Encontre Um ou Mais Criminosos em uma Caçada
 challengeType: 1
 forumTopicId: 301343
 dashedName: find-one-or-more-criminals-in-a-hunt
@@ -8,11 +8,11 @@ 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.
+Hora de testar as suas novas habilidades de regex. Um grupo de criminosos escapou da prisão, mas não sabemos quantos. No entanto, sabemos que eles ficam juntos quando estão no meio de outras pessoas. E você ficou responsável por encontrar todos eles.
 
-Here's an example to review how to do this:
+Vamos revisitar maneiras de executar essa tarefa:
 
-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:
+A regex `/z+/` encontra a letra `z` quando ela aparece uma ou mais vezes seguidas. Ela encontra resultados em todas essas strings:
 
 ```js
 "z"
@@ -22,7 +22,7 @@ The regex `/z+/` matches the letter `z` when it appears one or more times in a r
 "abczzzzzzzzzzzzzzzzzzzzzabc"
 ```
 
-But it does not find matches in the following strings since there are no letter `z` characters:
+Mas ela não encontra nada nessas strings, que não possuem `z` em lugar nenhum:
 
 ```js
 ""
@@ -32,23 +32,23 @@ But it does not find matches in the following strings since there are no letter
 
 # --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`.
+Escreva uma regex gananciosa que encontra uma ou mais criminosos em um grupo de pessoas. Um criminoso pode ser identificado pela letra maiúscula `C`.
 
 # --hints--
 
-Your regex should match one criminal (`C`) in the string `C`
+Sua regex deve encontrar um criminoso (`C`) na string `C`
 
 ```js
 assert('C'.match(reCriminals) && 'C'.match(reCriminals)[0] == 'C');
 ```
 
-Your regex should match two criminals (`CC`) in the string `CC`
+Sua regex deve encontrar dois criminosos (`CC`) na string `CC`
 
 ```js
 assert('CC'.match(reCriminals) && 'CC'.match(reCriminals)[0] == 'CC');
 ```
 
-Your regex should match three criminals (`CCC`) in the string `P1P5P4CCCcP2P6P3`.
+Sua regex deve encontrar três criminosos (`CCC`) na string `P1P5P4CCCcP2P6P3`.
 
 ```js
 assert(
@@ -57,7 +57,7 @@ assert(
 );
 ```
 
-Your regex should match five criminals (`CCCCC`) in the string `P6P2P7P4P5CCCCCP3P1`
+Sua regex deve encontrar cinco criminosos (`CCCCC`) na string `P6P2P7P4P5CCCCCP3P1`
 
 ```js
 assert(
@@ -66,19 +66,19 @@ assert(
 );
 ```
 
-Your regex should not match any criminals in the empty string `""`
+Sua regex não deve encontrar nenhum criminoso na string vazia `""`
 
 ```js
 assert(!reCriminals.test(''));
 ```
 
-Your regex should not match any criminals in the string `P1P2P3`
+Sua regex não deve encontrar nenhum criminoso na string `P1P2P3`
 
 ```js
 assert(!reCriminals.test('P1P2P3'));
 ```
 
-Your regex should match fifty criminals (`CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC`) in the string `P2P1P5P4CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCP3`.
+Sua regex deve encontrar cinquenta criminosos (`CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC`) na string `P2P1P5P4CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCP3`.
 
 ```js
 assert(
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
index 84ad9636ad..ee8615eb0c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db4367417b2b2512b91
-title: Ignore Case While Matching
+title: Ignore a Caixa ao Buscar
 challengeType: 1
 forumTopicId: 301344
 dashedName: ignore-case-while-matching
@@ -8,73 +8,73 @@ 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.
+Até agora você escreveu regexes para encontrar strings literais. Mas, às vezes, você pode querer encontrar caixas diferentes.
 
-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`.
+Caixa (-alta ou -baixa) é a diferença entre letras maiúsculas e minúsculas. São exemplos de caixa alta: `A`, `B` e `C`. `a`, `b` e `c` são exemplos de caixa baixa.
 
-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`.
+Você pode encontrar ambas as caixas usando algo que chamamos de <dfn>flag</dfn>. Existem várias flags, mas agora nós queremos a flag que ignora a caixa - a flag `i`. Para usá-la é só colocar ao fim da regex. Por exemplo, escrever `/ignorecase/i` é uma forma. Essa regex pode encontrar as strings `ignorecase`, `igNoreCase` e `IgnoreCase` (e todas as outras combinações de maiúsculas e minúsculas).
 
 # --instructions--
 
-Write a regex `fccRegex` to match `freeCodeCamp`, no matter its case. Your regex should not match any abbreviations or variations with spaces.
+Escreva uma regex `fccRegex` que encontre `freeCodeCamp`, não importa em que caixa esteja. Sua regex não deve buscar abreviações ou variações com espaços.
 
 # --hints--
 
-Your regex should match the string `freeCodeCamp`
+Sua regex deve encontrar a string `freeCodeCamp`
 
 ```js
 assert(fccRegex.test('freeCodeCamp'));
 ```
 
-Your regex should match the string `FreeCodeCamp`
+Sua regex deve encontrar a string `FreeCodeCamp`
 
 ```js
 assert(fccRegex.test('FreeCodeCamp'));
 ```
 
-Your regex should match the string `FreecodeCamp`
+Sua regex deve encontrar a string `FreecodeCamp`
 
 ```js
 assert(fccRegex.test('FreecodeCamp'));
 ```
 
-Your regex should match the string `FreeCodecamp`
+Sua regex deve encontrar a string `FreeCodecamp`
 
 ```js
 assert(fccRegex.test('FreeCodecamp'));
 ```
 
-Your regex should not match the string `Free Code Camp`
+Sua regex não deve encontrar a string `Free Code Camp`
 
 ```js
 assert(!fccRegex.test('Free Code Camp'));
 ```
 
-Your regex should match the string `FreeCOdeCamp`
+Sua regex deve encontrar a string `FreeCOdeCamp`
 
 ```js
 assert(fccRegex.test('FreeCOdeCamp'));
 ```
 
-Your regex should not match the string `FCC`
+Sua regex não deve encontrar a string `FCC`
 
 ```js
 assert(!fccRegex.test('FCC'));
 ```
 
-Your regex should match the string `FrEeCoDeCamp`
+Sua regex deve encontrar a string `FrEeCoDeCamp`
 
 ```js
 assert(fccRegex.test('FrEeCoDeCamp'));
 ```
 
-Your regex should match the string `FrEeCodECamp`
+Sua regex deve encontrar a string `FrEeCodECamp`
 
 ```js
 assert(fccRegex.test('FrEeCodECamp'));
 ```
 
-Your regex should match the string `FReeCodeCAmp`
+Sua regex deve encontrar a string `FReeCodeCAmp`
 
 ```js
 assert(fccRegex.test('FReeCodeCAmp'));
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
index 5a970259d2..0f08a2d32d 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db4367417b2b2512b90
-title: Match a Literal String with Different Possibilities
+title: Busque uma String Literal com Diferentes Possibilidades
 challengeType: 1
 forumTopicId: 301345
 dashedName: match-a-literal-string-with-different-possibilities
@@ -8,57 +8,57 @@ dashedName: match-a-literal-string-with-different-possibilities
 
 # --description--
 
-Using regexes like `/coding/`, you can look for the pattern `coding` in another string.
+Ao usar regexes como `/coding/`, você pode procurar pelo padrão `coding` em strings.
 
-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: `|`.
+Isso funciona com strings únicas, mas é limitado a apenas um padrão. Você pode procurar por múltiplos padrões usando o operador de `alternação`, ou `OU`: `|`.
 
-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/`.
+Este operador funciona para buscar padrões à esquerda e à direita dele. Por exemplo, se você quiser encontrar as strings `yes` ou `no`, a regex que você quer é `/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/`.
+Você pode também procurar por mais de dois padrões com este operador. É possível fazer isso ao adicionar mais instâncias do operador seguido do padrão desejado: `/yes|no|maybe/`.
 
 # --instructions--
 
-Complete the regex `petRegex` to match the pets `dog`, `cat`, `bird`, or `fish`.
+Complete a regex `petRegex` para encontrar os pets `dog`, `cat`, `bird`, ou `fish`.
 
 # --hints--
 
-Your regex `petRegex` should return `true` for the string `John has a pet dog.`
+Sua regex `petRegex` deve retornar `true` para a 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.`
+Sua regex `petRegex` deve retornar `false` para a 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.`
+Sua regex `petRegex` deve retornar `true` para a 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.`
+Sua regex `petRegex` deve retornar `true` para a 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.`
+Sua regex `petRegex` deve retornar `false` para a 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.`
+Sua regex `petRegex` deve retornar `true` para a 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.`
+Sua regex `petRegex` deve retornar `false` para a string `Jimmy has a pet computer.`
 
 ```js
 assert(!petRegex.test('Jimmy has a pet computer.'));
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
index 716adc5104..dca59ec491 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db7367417b2b2512b9f
-title: Match All Letters and Numbers
+title: Capture Todas as Letras e Números
 challengeType: 1
 forumTopicId: 301346
 dashedName: match-all-letters-and-numbers
@@ -8,9 +8,9 @@ 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.
+Ao escrever `[a-z]` você foi capaz de capturar todas as letras do alfabeto. Essa classe de caracteres é tão comum que existe uma forma reduzida de escrevê-la. Mas essa forma inclui alguns caracteres a mais.
 
-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 (`_`).
+Em JavaScript, você pode usar `\w` para capturar todas as letras do alfabeto. Isso é equivalente à classe de caracteres `[A-Za-z0-9_]`. Ela captura números e letras, tanto maiúsculas quanto minúsculas. Note que o underline (`_`) também é incluído nela.
 
 ```js
 let longHand = /[A-Za-z0-9_]+/;
@@ -23,29 +23,29 @@ longHand.test(varNames);
 shortHand.test(varNames);
 ```
 
-All four of these `test` calls would return `true`.
+As quatro chamadas a `test` retornam `true`.
 
-These shortcut character classes are also known as <dfn>shorthand character classes</dfn>.
+Essas formas reduzidas de classes de caracteres podem ser chamadas de <dfn>atalhos</dfn>.
 
 # --instructions--
 
-Use the shorthand character class `\w` to count the number of alphanumeric characters in various quotes and strings.
+Use o atalho `\w` para contar o número de caracteres alfanuméricos em várias strings.
 
 # --hints--
 
-Your regex should use the global flag.
+Sua regex deve usar a flag global.
 
 ```js
 assert(alphabetRegexV2.global);
 ```
 
-Your regex should use the shorthand character `\w` to match all characters which are alphanumeric.
+Sua regex deve usar o atalho `\w` para capturar todos os caracteres alfanuméricos.
 
 ```js
 assert(/\\w/.test(alphabetRegexV2.source));
 ```
 
-Your regex should find 31 alphanumeric characters in the string `The five boxing wizards jump quickly.`
+Sua regex deve encontrar 31 caracteres alfanuméricos na string `The five boxing wizards jump quickly.`
 
 ```js
 assert(
@@ -53,7 +53,7 @@ assert(
 );
 ```
 
-Your regex should find 32 alphanumeric characters in the string `Pack my box with five dozen liquor jugs.`
+Sua regex deve encontrar 32 caracteres alfanuméricos na string `Pack my box with five dozen liquor jugs.`
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-Your regex should find 30 alphanumeric characters in the string `How vexingly quick daft zebras jump!`
+Sua regex deve encontrar 30 caracteres alfanuméricos na string `How vexingly quick daft zebras jump!`
 
 ```js
 assert(
@@ -70,7 +70,7 @@ assert(
 );
 ```
 
-Your regex should find 36 alphanumeric characters in the string `123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.`
+Sua regex deve encontrar 36 caracteres alfanuméricos na string `123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.`
 
 ```js
 assert(
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
index 3eed2453f2..f78d180bc5 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db8367417b2b2512ba1
-title: Match All Non-Numbers
+title: Capture Tudo Exceto Números
 challengeType: 1
 forumTopicId: 301347
 dashedName: match-all-non-numbers
@@ -8,59 +8,59 @@ 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.
+O último desafio mostrou como procurar dígitos usando o atalho `\d` com um `d` minúsculo. Você também pode procurar não-dígitos usando um atalho semelhante que usa um `D` maiúsculo.
 
-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.
+O atalho para procurar não-dígitos é `\D`. Esse atalho é o mesmo que `[^0-9]`, que serve para procurar qualquer caractere que não seja um dígito de zero a nove.
 
 # --instructions--
 
-Use the shorthand character class for non-digits `\D` to count how many non-digits are in movie titles.
+Use o atalho `\D` para contar quantos não-dígitos existem em títulos de filmes.
 
 # --hints--
 
-Your regex should use the shortcut character to match non-digit characters
+Sua regex deve usar o atalho que captura não-dígitos
 
 ```js
 assert(/\\D/.test(noNumRegex.source));
 ```
 
-Your regex should use the global flag.
+Sua regex deve usar a flag global.
 
 ```js
 assert(noNumRegex.global);
 ```
 
-Your regex should find no non-digits in the string `9`.
+Sua regex não deve encontrar nenhum não-dígito na string `9`.
 
 ```js
 assert('9'.match(noNumRegex) == null);
 ```
 
-Your regex should find 6 non-digits in the string `Catch 22`.
+Sua regex deve encontrar seis não-dígitos na string `Catch 22`.
 
 ```js
 assert('Catch 22'.match(noNumRegex).length == 6);
 ```
 
-Your regex should find 11 non-digits in the string `101 Dalmatians`.
+Sua regex deve encontrar onze não-dígitos na string `101 Dalmatians`.
 
 ```js
 assert('101 Dalmatians'.match(noNumRegex).length == 11);
 ```
 
-Your regex should find 15 non-digits in the string `One, Two, Three`.
+Sua regex deve encontrar quinze não-dígitos na 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`.
+Sua regex deve encontrar 12 não-dígitos na 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`.
+Sua regex deve encontrar dezessete não-dígitos na string `2001: A Space Odyssey`.
 
 ```js
 assert('2001: A Space Odyssey'.match(noNumRegex).length == 17);
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
index f4a6505e86..623089054c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 5d712346c441eddfaeb5bdef
-title: Match All Numbers
+title: Capture Todos os Números
 challengeType: 1
 forumTopicId: 18181
 dashedName: match-all-numbers
@@ -8,59 +8,59 @@ 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.
+Você aprendeu atalhos para padrões comuns de strings como alfanuméricos. Outro padrão comum é o de apenas dígitos ou números.
 
-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.
+O atalho para procurar caracteres numéricos é `\d`, com um `d` minúsculo. Esse atalho é o mesmo que `[0-9]`, que serve para procurar qualquer dígito de zero a nove.
 
 # --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.
+Use o atalho `\d` para contar quantos dígitos existem em títulos de filmes. Números por extenso, como "seis" em vez de 6, não contam.
 
 # --hints--
 
-Your regex should use the shortcut character to match digit characters
+Sua regex deve usar o atalho que captura dígitos
 
 ```js
 assert(/\\d/.test(numRegex.source));
 ```
 
-Your regex should use the global flag.
+Sua regex deve usar a flag global.
 
 ```js
 assert(numRegex.global);
 ```
 
-Your regex should find 1 digit in the string `9`.
+Sua regex deve encontrar um dígito na string `9`.
 
 ```js
 assert('9'.match(numRegex).length == 1);
 ```
 
-Your regex should find 2 digits in the string `Catch 22`.
+Sua regex deve encontrar dois dígitos na string `Catch 22`.
 
 ```js
 assert('Catch 22'.match(numRegex).length == 2);
 ```
 
-Your regex should find 3 digits in the string `101 Dalmatians`.
+Sua regex deve encontrar três dígitos na string `101 Dalmatians`.
 
 ```js
 assert('101 Dalmatians'.match(numRegex).length == 3);
 ```
 
-Your regex should find no digits in the string `One, Two, Three`.
+Sua regex não deve encontrar dígito algum na string `One, Two, Three`.
 
 ```js
 assert('One, Two, Three'.match(numRegex) == null);
 ```
 
-Your regex should find 2 digits in the string `21 Jump Street`.
+Sua regex deve encontrar dois dígitos na 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`.
+Sua regex deve encontrar quatro dígitos na string `2001: A Space Odyssey`.
 
 ```js
 assert('2001: A Space Odyssey'.match(numRegex).length == 4);
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
index 3306cfb8c7..ea738bfaf0 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db5367417b2b2512b94
-title: Match Anything with Wildcard Period
+title: Encontre Qualquer Coisa com o Caractere Curinga
 challengeType: 1
 forumTopicId: 301348
 dashedName: match-anything-with-wildcard-period
@@ -8,9 +8,9 @@ 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: `.`
+Haverá vezes em que você não saberá (ou não precisará saber) quais caracteres exatamente farão parte das suas regexes. Pensar em todas as palavras que capturariam, digamos, um erro ortográfico levaria muito tempo. Por sorte, você pode economizar tempo usando o caractere curinga: `.`
 
-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.
+O caractere curinga `.` captura qualquer caractere. O curinga também pode ser chamado de `ponto`. Você pode usar o curinga como qualquer outro caractere na regex. Por exemplo, se você quiser encontrar `hug`, `huh`, `hut` ou `hum`, você pode usar a regex `/hu./` para capturar todas as quatro palavras.
 
 ```js
 let humStr = "I'll hum a song";
@@ -20,62 +20,62 @@ huRegex.test(humStr);
 huRegex.test(hugStr);
 ```
 
-Both of these `test` calls would return `true`.
+As duas chamadas a `test` retornam `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.
+Complete a regex `unRegex` para que ela encontre as strings `run`, `sun`, `fun`, `pun`, `nun` e `bun`. Sua regex deve usar o caractere curinga.
 
 # --hints--
 
-You should use the `.test()` method.
+Você deve usar o método `.test()`.
 
 ```js
 assert(code.match(/\.test\(.*\)/));
 ```
 
-You should use the wildcard character in your regex `unRegex`
+Você deve usar o caractere curinga na regex `unRegex`
 
 ```js
 assert(/\./.test(unRegex.source));
 ```
 
-Your regex `unRegex` should match `run` in the string `Let us go on a run.`
+Sua regex `unRegex` deve encontrar `run` na 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.`
+Sua regex `unRegex` deve encontrar `sun` na 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.`
+Sua regex `unRegex` deve encontrar `fun` na 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.`
+Sua regex `unRegex` deve encontrar `pun` na 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.`
+Sua regex `unRegex` deve encontrar `nun` na 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.`
+Sua regex `unRegex` deve encontrar `bun` na string `She got fired from the hot dog stand for putting her hair in a bun.`
 
 ```js
 unRegex.lastIndex = 0;
@@ -86,14 +86,14 @@ assert(
 );
 ```
 
-Your regex `unRegex` should not match the string `There is a bug in my code.`
+Sua regex `unRegex` não deve incluir a string `There is a bug in my code.` no resultado
 
 ```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.`
+Sua regex `unRegex` não deve incluir a string `Catch me if you can.` no resultado
 
 ```js
 unRegex.lastIndex = 0;
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
index 6d2b1dec50..adaf3c2bbc 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db7367417b2b2512b9d
-title: Match Beginning String Patterns
+title: Padrões de Início de String
 challengeType: 1
 forumTopicId: 301349
 dashedName: match-beginning-string-patterns
@@ -8,9 +8,9 @@ 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.
+Desafios anteriores mostraram que expressões regulares podem ser usadas para capturar um número de resultados. Elas também podem ser usadas para procurar em posições específicas de 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.
+Mais cedo você usou o circunflexo (`^`) em classes de caracteres para procurar caracteres que não devem ser capturados, como em `[^caracteresQueNãoQueremos]`. Quando usados fora de classes de caracteres, o circunflexo serve para buscar a partir do começo de strings.
 
 ```js
 let firstString = "Ricky is first and can be found.";
@@ -20,33 +20,33 @@ let notFirst = "You can't find Ricky now.";
 firstRegex.test(notFirst);
 ```
 
-The first `test` call would return `true`, while the second would return `false`.
+A primeira chamada a `test` retorna `true` enquanto a segunda retorna `false`.
 
 # --instructions--
 
-Use the caret character in a regex to find `Cal` only in the beginning of the string `rickyAndCal`.
+Use o circunflexo em uma regex para encontrar `Cal`, mas apenas no começo da string `rickyAndCal`.
 
 # --hints--
 
-Your regex should search for the string `Cal` with a capital letter.
+Sua regex deve buscar a string `Cal` com uma maiúscula.
 
 ```js
 assert(calRegex.source == '^Cal');
 ```
 
-Your regex should not use any flags.
+Sua regex não deve usar nenhuma flag.
 
 ```js
 assert(calRegex.flags == '');
 ```
 
-Your regex should match the string `Cal` at the beginning of the string.
+Sua regex deve capturar a string `Cal` no começo de uma 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.
+Sua regex não deve capturar a string `Cal` no meio de uma string.
 
 ```js
 assert(!calRegex.test('Ricky and Cal both like racing.'));
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
index c9d82ef7f7..31cade5e2f 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db6367417b2b2512b99
-title: Match Characters that Occur One or More Times
+title: Capture Caracteres que Aparecem Uma ou Mais Vezes Seguidas
 challengeType: 1
 forumTopicId: 301350
 dashedName: match-characters-that-occur-one-or-more-times
@@ -8,33 +8,33 @@ 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.
+Às vezes você precisa capturar um caractere, ou grupo de caracteres, que aparece uma ou mais vezes seguidas. Ou seja, que aparecem pelo menos uma vez e podem se repetir.
 
-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.
+Você pode usar o caractere `+` para verificar se é o caso. Lembre-se que o caractere ou padrão precisa repetir-se consecutivamente. Ou seja, um atrás do outro.
 
-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"]`.
+Por exemplo, `/a+/g` encontra um resultado na string `abc` e retorna `["a"]`. Mas o `+` também faz com que encontre um único resultado em `aabc` e retorne `["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.
+Se a string fosse `abab`, a operação retornaria `["a", "a"]` porque entre os dois `a` há um `b`. Por fim, se não houvesse nenhum `a` na string, como em `bcd`, nada seria encontrado.
 
 # --instructions--
 
-You want to find matches when the letter `s` occurs one or more times in `Mississippi`. Write a regex that uses the `+` sign.
+Você quer capturar as ocorrências de `s` quando acontecer uma ou mais vezes em `Mississippi`. Escreve uma regex que use o caractere `+`.
 
 # --hints--
 
-Your regex `myRegex` should use the `+` sign to match one or more `s` characters.
+Sua regex `myRegex` deve usar o caractere `+` para encontrar um ou mais `s`s.
 
 ```js
 assert(/\+/.test(myRegex.source));
 ```
 
-Your regex `myRegex` should match 2 items.
+Sua regex `myRegex` deve encontrar 2 itens.
 
 ```js
 assert(result.length == 2);
 ```
 
-The `result` variable should be an array with two matches of `ss`
+A variável `result` deve ser um array com dois `ss`
 
 ```js
 assert(result[0] == 'ss' && result[1] == 'ss');
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
index aaa4fdba5a..859a3f45ef 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db6367417b2b2512b9a
-title: Match Characters that Occur Zero or More Times
+title: Capture Caracteres que Aparecem Zero ou Mais Vezes Seguidas
 challengeType: 1
 forumTopicId: 301351
 dashedName: match-characters-that-occur-zero-or-more-times
@@ -8,9 +8,9 @@ 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.
+O último desafio fez uso do caractere `+` para buscar caracteres que ocorrem uma ou mais vezes. Existe um outro caractere que permite buscar zero ou mais ocorrências de um padrão.
 
-The character to do this is the asterisk or star: `*`.
+O caractere usado para isso é o asterisco: `*`.
 
 ```js
 let soccerWord = "gooooooooal!";
@@ -22,39 +22,39 @@ gPhrase.match(goRegex);
 oPhrase.match(goRegex);
 ```
 
-In order, the three `match` calls would return the values `["goooooooo"]`, `["g"]`, and `null`.
+As três chamadas a `match` retornam, na ordem, os valores: `["goooooooo"]`, `["g"]` e `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.
+Neste desafio, a string `chewieQuote` recebeu o valor `Aaaaaaaaaaaaaaaarrrgh!` por trás dos panos. Escreva uma regex, `chewieRegex`, que usa o caractere `*` para capturar um `A` maiúsculo seguido imediatamente de zero ou mais `a` minúsculos em `chewieQuote`. Sua regex não precisa de flags ou de classes de caracteres. Ela também não deve capturar nenhuma outra parte da string.
 
 # --hints--
 
-Your regex `chewieRegex` should use the `*` character to match zero or more `a` characters.
+Sua regex `chewieRegex` deve usar o caractere `*` para encontrar zero ou mais `a`s.
 
 ```js
 assert(/\*/.test(chewieRegex.source));
 ```
 
-Your regex should match the string `A` in `chewieQuote`.
+Sua regex deve encontrar a string `A` em `chewieQuote`.
 
 ```js
 assert(result[0][0] === 'A');
 ```
 
-Your regex should match the string `Aaaaaaaaaaaaaaaa` in `chewieQuote`.
+Sua regex deve encontrar a string `Aaaaaaaaaaaaaaaa` em `chewieQuote`.
 
 ```js
 assert(result[0] === 'Aaaaaaaaaaaaaaaa');
 ```
 
-Your regex `chewieRegex` should match 16 characters in `chewieQuote`.
+Sua regex `chewieRegex` deve capturar 16 caracteres em `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.`
+Sua expressão regular não deve corresponder com nenhum caractere na string `He made a fair move. Screaming about it can't help you.`
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-Your regex should not match any characters in the string `Let him have it. It's not wise to upset a Wookiee.`
+Sua expressão regular não deve corresponder a nenhum caractere na string `Let him have it. It's not wise to upset a Wookiee.`
 
 ```js
 assert(
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
index 28a0024ffc..91d839042e 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db7367417b2b2512b9e
-title: Match Ending String Patterns
+title: Padrões de Fim de String
 challengeType: 1
 forumTopicId: 301352
 dashedName: match-ending-string-patterns
@@ -8,9 +8,9 @@ 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.
+No desafio anterior, você aprendeu a usar o circunflexo para capturar padrões no início de strings. Há também uma maneira de buscar padrões no fim de strings.
 
-You can search the end of strings using the dollar sign character `$` at the end of the regex.
+Se você colocar um cifrão, `$`, no fim da regex, você pode buscar no fim de strings.
 
 ```js
 let theEnding = "This is a never ending story";
@@ -20,27 +20,27 @@ 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`.
+A primeira chamada a `test` retorna `true` enquanto a segunda retorna `false`.
 
 # --instructions--
 
-Use the anchor character (`$`) to match the string `caboose` at the end of the string `caboose`.
+Use o cifrão (`$`) para capturar a string `caboose` no fim da string `caboose`.
 
 # --hints--
 
-You should search for `caboose` with the dollar sign `$` anchor in your regex.
+Você deve usar o cifrão `$` na sua regex para buscar a string `caboose`.
 
 ```js
 assert(lastRegex.source == 'caboose$');
 ```
 
-Your regex should not use any flags.
+Sua regex não deve usar nenhuma flag.
 
 ```js
 assert(lastRegex.flags == '');
 ```
 
-You should match `caboose` at the end of the string `The last car on a train is the caboose`
+Você deve capturar `caboose` no fim da string `The last car on a train is the caboose`
 
 ```js
 assert(lastRegex.test('The last car on a train is the 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
index ac2c15b427..3a5cc23376 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db8367417b2b2512ba0
-title: Match Everything But Letters and Numbers
+title: Capture Tudo Exceto Letras e Números
 challengeType: 1
 forumTopicId: 301353
 dashedName: match-everything-but-letters-and-numbers
@@ -8,9 +8,9 @@ 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.
+Você aprendeu que você pode usar um atalho para capturar alfanuméricos `[A-Za-z0-9_]` usando `\w`. Você pode querer capturar exatamente o oposto disso.
 
-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_]`.
+Você pode capturar não-alfanuméricos usando `\W` ao invés de `\w`. Observe que o atalho usa uma maiúscula. Este atalho é o mesmo que escrever `[^A-Za-z0-9_]`.
 
 ```js
 let shortHand = /\W/;
@@ -20,21 +20,21 @@ numbers.match(shortHand);
 sentence.match(shortHand);
 ```
 
-The first `match` call would return the value `["%"]` and the second would return `["!"]`.
+A primeira chamada a `match` retorna `["%"]` enquanto o segundo retorna `["!"]`.
 
 # --instructions--
 
-Use the shorthand character class `\W` to count the number of non-alphanumeric characters in various quotes and strings.
+Use o atalho `\W` para contar o número de caracteres não-alfanuméricos em várias strings.
 
 # --hints--
 
-Your regex should use the global flag.
+Sua regex deve usar a flag global.
 
 ```js
 assert(nonAlphabetRegex.global);
 ```
 
-Your regex should find 6 non-alphanumeric characters in the string `The five boxing wizards jump quickly.`.
+Sua regex deve encontrar 6 caracteres não-alfanuméricos na string `The five boxing wizards jump quickly.`.
 
 ```js
 assert(
@@ -42,13 +42,13 @@ assert(
 );
 ```
 
-Your regex should use the shorthand character to match characters which are non-alphanumeric.
+Sua regex deve usar o atalho que captura os caracteres não-alfanuméricos.
 
 ```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.`
+Sua regex deve encontrar 8 caracteres não-alfanuméricos na string `Pack my box with five dozen liquor jugs.`
 
 ```js
 assert(
@@ -56,7 +56,7 @@ assert(
 );
 ```
 
-Your regex should find 6 non-alphanumeric characters in the string `How vexingly quick daft zebras jump!`
+Sua regex deve encontrar 6 caracteres não-alfanuméricos na string `How vexingly quick daft zebras jump!`
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-Your regex should find 12 non-alphanumeric characters in the string `123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.`
+Sua regex deve encontrar 12 caracteres não-alfanuméricos na string `123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.`
 
 ```js
 assert(
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
index 7e5d5d86e4..2e097a5042 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db5367417b2b2512b96
-title: Match Letters of the Alphabet
+title: Capture Letras do Alfabeto
 challengeType: 1
 forumTopicId: 301354
 dashedName: match-letters-of-the-alphabet
@@ -8,11 +8,11 @@ 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.
+Você viu como pode usar <dfn>classes de caracteres</dfn> para especificar um grupo de caracteres para capturar. Mas você precisaria escrever muito para definir uma classe larga como, por exemplo, para capturar todas as letras do alfabeto. Felizmente há uma maneira de fazer com que elas fiquem pequenas e simples.
 
-Inside a character set, you can define a range of characters to match using a hyphen character: `-`.
+Você pode usar um hífen (`-`) para definir um intervalo de caracteres para capturar dentro de uma classe.
 
-For example, to match lowercase letters `a` through `e` you would use `[a-e]`.
+Por exemplo, para encontrar letras minúsculas de `a` a `e`, você pode escrever `[a-e]`.
 
 ```js
 let catStr = "cat";
@@ -24,29 +24,29 @@ batStr.match(bgRegex);
 matStr.match(bgRegex);
 ```
 
-In order, the three `match` calls would return the values `["cat"]`, `["bat"]`, and `null`.
+As três chamadas a `match` retornam, na ordem, os valores: `["cat"]`, `["bat"]` e `null`.
 
 # --instructions--
 
-Match all the letters in the string `quoteSample`.
+Capture todas as letras na string `quoteSample`.
 
-**Note**: Be sure to match both uppercase and lowercase letters.
+**Nota:** Você quer encontrar tanto maiúsculas quanto minúsculas.
 
 # --hints--
 
-Your regex `alphabetRegex` should match 35 items.
+Sua regex `alphabetRegex` deve encontrar 35 itens.
 
 ```js
 assert(result.length == 35);
 ```
 
-Your regex `alphabetRegex` should use the global flag.
+Você deve usar a flag global na sua regex `alphabetRegex`.
 
 ```js
 assert(alphabetRegex.flags.match(/g/).length == 1);
 ```
 
-Your regex `alphabetRegex` should use the case insensitive flag.
+Você deve usar a flag de ignorar caixa na sua regex `alphabetRegex`.
 
 ```js
 assert(alphabetRegex.flags.match(/i/).length == 1);
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
index 5cdea6123e..2e5e8b356d 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db3367417b2b2512b8f
-title: Match Literal Strings
+title: Correspondência de strings literais
 challengeType: 1
 forumTopicId: 301355
 dashedName: match-literal-strings
@@ -8,7 +8,7 @@ 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`:
+No desafio anterior, você usou a expressão regular `/Hello/` para procurar a palavra `Hello`. Esta regex buscou a string `Hello` literalmente. No exemplo abaixo há outra busca literal, dessa vez pela string `Kevin`:
 
 ```js
 let testStr = "Hello, my name is Kevin.";
@@ -16,38 +16,38 @@ let testRegex = /Kevin/;
 testRegex.test(testStr);
 ```
 
-This `test` call will return `true`.
+Essa chamada a `test` retornará `true`.
 
-Any other forms of `Kevin` will not match. For example, the regex `/Kevin/` will not match `kevin` or `KEVIN`.
+Qualquer outra forma de escrever `Kevin` não funcionará. Por exemplo, a regex `/Kevin/` não encontrará nem `kevin` e nem `KEVIN`.
 
 ```js
 let wrongRegex = /kevin/;
 wrongRegex.test(testStr);
 ```
 
-This `test` call will return `false`.
+`test` retornará `false`.
 
-A future challenge will show how to match those other forms as well.
+Você verá como encontrar estas outras formas em alguns desafios futuros.
 
 # --instructions--
 
-Complete the regex `waldoRegex` to find `"Waldo"` in the string `waldoIsHiding` with a literal match.
+Complete a regex `waldoRegex` para encontrar `"Waldo"` na string `waldoIsHiding` de forma literal.
 
 # --hints--
 
-Your regex `waldoRegex` should find the string `Waldo`
+Sua regex `waldoRegex` deve encontrar a string `Waldo`
 
 ```js
 assert(waldoRegex.test(waldoIsHiding));
 ```
 
-Your regex `waldoRegex` should not search for anything else.
+Sua regex `waldoRegex` não deve buscar nada além disso.
 
 ```js
 assert(!waldoRegex.test('Somewhere is hiding in this text.'));
 ```
 
-You should perform a literal string match with your regex.
+A busca com a regex deve ser por uma string literal.
 
 ```js
 assert(!/\/.*\/i/.test(code));
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
index a35a8aa487..45a1872af5 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db9367417b2b2512ba4
-title: Match Non-Whitespace Characters
+title: Capture Caracteres Não-Espaço
 challengeType: 1
 forumTopicId: 18210
 dashedName: match-non-whitespace-characters
@@ -8,9 +8,9 @@ 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.
+Você aprendeu a procurar por espaço em branco usando `\s` com um `s` minúsculo. Você também pode buscar tudo exceto espaços em branco.
 
-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]`.
+Busque não-espaços em branco usando `\S` com um `s` maiúsculo. Este atalho não captura espaços em branco, retorno de carro, tabulações, feeds de formulário ou quebras de linha. O atalho é equivalente à classe de caracteres `[^ \r\t\f\n\v]`.
 
 ```js
 let whiteSpace = "Whitespace. Whitespace everywhere!"
@@ -18,27 +18,27 @@ let nonSpaceRegex = /\S/g;
 whiteSpace.match(nonSpaceRegex).length;
 ```
 
-The value returned by the `.length` method would be `32`.
+O valor retornado pelo método `.length` aqui é `32`.
 
 # --instructions--
 
-Change the regex `countNonWhiteSpace` to look for multiple non-whitespace characters in a string.
+Modifique a regex `countNonWhiteSpace` para que encontre tudo exceto espaços em branco em uma string.
 
 # --hints--
 
-Your regex should use the global flag.
+Sua regex deve usar a flag global.
 
 ```js
 assert(countNonWhiteSpace.global);
 ```
 
-Your regex should use the shorthand character `\S` to match all non-whitespace characters.
+Sua regex deve usar o atalho `\S` para capturar tudo menos espaços em branco.
 
 ```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.`
+Sua regex deve encontrar 35 não-espaços na string `Men are from Mars and women are from Venus.`
 
 ```js
 assert(
@@ -47,13 +47,13 @@ assert(
 );
 ```
 
-Your regex should find 23 non-spaces in the string `Space: the final frontier.`
+Sua regex deve encontrar 23 não-espaços na 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`
+Sua regex deve encontrar 21 não-espaços na string `MindYourPersonalSpace`
 
 ```js
 assert('MindYourPersonalSpace'.match(countNonWhiteSpace).length == 21);
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
index bfc04f2661..f74c9478ff 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db5367417b2b2512b97
-title: Match Numbers and Letters of the Alphabet
+title: Capture Números e Letras do Alfabeto
 challengeType: 1
 forumTopicId: 301356
 dashedName: match-numbers-and-letters-of-the-alphabet
@@ -8,11 +8,11 @@ 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.
+O uso do hífen (`-`) para capturar um intervalo de caracteres não é limitado a letras. Ele também funciona para capturar intervalos de números.
 
-For example, `/[0-5]/` matches any number between `0` and `5`, including the `0` and `5`.
+Por exemplo, `/[0-5]/` encontra qualquer número entre `0` e `5`, incluindo ambos `0` e `5`.
 
-Also, it is possible to combine a range of letters and numbers in a single character set.
+E também é possível combinar intervalos de letras e números em uma única classe de caracteres.
 
 ```js
 let jennyStr = "Jenny8675309";
@@ -22,23 +22,23 @@ 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.
+Escreva uma única regex que encontra letras entre `h` e `s` e, também, números entre `2` e `6`. Lembre-se de incluir as flags necessárias na regex.
 
 # --hints--
 
-Your regex `myRegex` should match 17 items.
+Sua regex `myRegex` deve encontrar 17 itens.
 
 ```js
 assert(result.length == 17);
 ```
 
-Your regex `myRegex` should use the global flag.
+Você deve usar a flag global na sua regex `myRegex`.
 
 ```js
 assert(myRegex.flags.match(/g/).length == 1);
 ```
 
-Your regex `myRegex` should use the case insensitive flag.
+Você deve usar a flag de ignorar caixa na sua regex `myRegex`.
 
 ```js
 assert(myRegex.flags.match(/i/).length == 1);
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
index ba055ac4c1..5f00e859c2 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db5367417b2b2512b95
-title: Match Single Character with Multiple Possibilities
+title: Capture um Único Caractere com Múltiplas Possibilidades
 challengeType: 1
 forumTopicId: 301357
 dashedName: match-single-character-with-multiple-possibilities
@@ -8,11 +8,11 @@ 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.
+Você aprendeu a capturar padrões literais (`/literal/`) e usar o caractere curinga (`/./`). Eles são os extremos das expressões regulares: um encontra o texto exato e o outro captura qualquer coisa. Existem formas de balancear esses extremos.
 
-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.
+Você pode ter alguma flexibilidade ao procurar um padrão literal usando <dfn>classes de caracteres</dfn>. Classes de caracteres permitem a definição de grupos de caracteres que você quer capturar ao colocá-los entre colchetes: `[` e `]`.
 
-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`.
+Por exemplo, se você quiser encontrar `bag`, `big` e `bug` mas não `bog`. Você pode escrever a regex `/b[aiu]g/` para isso. `[aiu]` é a classe de caracteres que só capturará `a`, `i` ou `u`.
 
 ```js
 let bigStr = "big";
@@ -26,41 +26,41 @@ bugStr.match(bgRegex);
 bogStr.match(bgRegex);
 ```
 
-In order, the four `match` calls would return the values `["big"]`, `["bag"]`, `["bug"]`, and `null`.
+As quatro chamadas a `match` retornarão os seguintes valores, nesta ordem: `["big"]`, `["bag"]`, `["bug"]` e `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`.
+Use classe de caracteres de vogais (`a`, `e`, `i`, `o`, `u`) na sua regex `vowelRegex` para encontrar todas as vogais na string `quoteSample`.
 
-**Note:** Be sure to match both upper- and lowercase vowels.
+**Nota:** Você quer encontrar tanto maiúsculas quanto minúsculas.
 
 # --hints--
 
-You should find all 25 vowels.
+Você deve encontrar todas as 25 vogais.
 
 ```js
 assert(result.length == 25);
 ```
 
-Your regex `vowelRegex` should use a character class.
+Você deve usar uma classe de caracteres na sua regex `vowelRegex`.
 
 ```js
 assert(/\[.*\]/.test(vowelRegex.source));
 ```
 
-Your regex `vowelRegex` should use the global flag.
+Você deve usar a flag global na sua regex `vowelRegex`.
 
 ```js
 assert(vowelRegex.flags.match(/g/).length == 1);
 ```
 
-Your regex `vowelRegex` should use the case insensitive flag.
+Você deve usar a flag de ignorar caixa na sua regex `vowelRegex`.
 
 ```js
 assert(vowelRegex.flags.match(/i/).length == 1);
 ```
 
-Your regex should not match any consonants.
+Sua regex não deve encontrar nenhuma consoante.
 
 ```js
 assert(!/[b-df-hj-np-tv-z]/gi.test(result.join()));
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
index a0f6672834..0224bfb441 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db6367417b2b2512b98
-title: Match Single Characters Not Specified
+title: Capture Caracteres Não Especificados
 challengeType: 1
 forumTopicId: 301358
 dashedName: match-single-characters-not-specified
@@ -8,31 +8,31 @@ 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>.
+Até agora você aprendeu a criar classes de caracteres para capturar caracteres específicos, mas você também pode usá-las para capturar caracteres ausentes nelas. Esse tipo de classe de caracteres é chamada <dfn>classe de caracteres negada</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.
+Para criar uma classe de caracteres negada, você só precisa colocar um acento circunflexo (`^`) depois do colchete de abertura e à esquerda dos caracteres que você quer evitar.
 
-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.
+Por exemplo, `/[^aeiou]/gi` encontra todos os caracteres que não são vogais. Observe que caracteres como `.`, `!`, `[`, `@`, `/` e espaços em branco são capturados - a classe de vogais negada apenas exclui os caracteres que são vogais.
 
 # --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.
+Crie uma única regex que captura todos os caracteres que não são números ou vogais. Lembre-se de incluir as flags necessárias na regex.
 
 # --hints--
 
-Your regex `myRegex` should match 9 items.
+Sua regex `myRegex` deve encontrar 9 itens.
 
 ```js
 assert(result.length == 9);
 ```
 
-Your regex `myRegex` should use the global flag.
+Você deve usar a flag global na sua regex `myRegex`.
 
 ```js
 assert(myRegex.flags.match(/g/).length == 1);
 ```
 
-Your regex `myRegex` should use the case insensitive flag.
+Você deve usar a flag de ignorar caixa na sua regex `myRegex`.
 
 ```js
 assert(myRegex.flags.match(/i/).length == 1);
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
index f055b0d4a9..e085aa4e03 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db8367417b2b2512ba3
-title: Match Whitespace
+title: Capture Espaço em Branco
 challengeType: 1
 forumTopicId: 301359
 dashedName: match-whitespace
@@ -8,9 +8,9 @@ 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.
+Os desafios até agora cobriram a captura de letras do alfabeto e números. Você também pode capturar espaços em branco e os espaços entre as letras.
 
-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]`.
+Você pode usar o atalho `\s` com um `s` minúsculo para capturar espaços em branco. Este atalho não captura apenas espaços em branco como também retorno de carro, tabulações, feeds de formulário e quebras de linha. O atalho é equivalente à classe de caracteres `[ \r\t\f\n\v]`.
 
 ```js
 let whiteSpace = "Whitespace. Whitespace everywhere!"
@@ -18,26 +18,26 @@ let spaceRegex = /\s/g;
 whiteSpace.match(spaceRegex);
 ```
 
-This `match` call would return `[" ", " "]`.
+`match` retorna `[" ", " "]` aqui.
 # --instructions--
 
-Change the regex `countWhiteSpace` to look for multiple whitespace characters in a string.
+Mude a regex `countWhiteSpace` para que capture múltiplos espaços em branco em strings.
 
 # --hints--
 
-Your regex should use the global flag.
+Sua regex deve usar a flag global.
 
 ```js
 assert(countWhiteSpace.global);
 ```
 
-Your regex should use the shorthand character `\s` to match all whitespace characters.
+Sua regex deve usar o atalho `\s` para capturar todos os espaços em branco.
 
 ```js
 assert(/\\s/.test(countWhiteSpace.source));
 ```
 
-Your regex should find eight spaces in the string `Men are from Mars and women are from Venus.`
+Sua regex deve encontrar oito espaços na string `Men are from Mars and women are from Venus.`
 
 ```js
 assert(
@@ -46,13 +46,13 @@ assert(
 );
 ```
 
-Your regex should find three spaces in the string `Space: the final frontier.`
+Sua regex deve encontrar três espaços na 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`
+Sua regex não deve encontrar espaços na string `MindYourPersonalSpace`
 
 ```js
 assert('MindYourPersonalSpace'.match(countWhiteSpace) == null);
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
index 0065d0cdf5..ba2a656352 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dba367417b2b2512ba9
-title: Positive and Negative Lookahead
+title: Lookaheads positivos e negativos
 challengeType: 1
 forumTopicId: 301360
 dashedName: positive-and-negative-lookahead
@@ -8,15 +8,15 @@ 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.
+<dfn>Lookaheads</dfn> ("olhar à frente") são padrões que dizem ao JavaScript para procurar outros padrões ao longo da string sem capturá-los. Eles podem ser úteis quando é necessário fazer diversas verificações na mesma string.
 
-There are two kinds of lookaheads: <dfn>positive lookahead</dfn> and <dfn>negative lookahead</dfn>.
+Existem dois tipos de lookahead: o <dfn>lookahead positivo</dfn> e o <dfn>lookahead negativo</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.
+Lookaheads positivos garantem que o padrão especificado se encontra à frente, mas não o capturam. Usa-se `(?=...)`, onde `...` é o padrão a ser procurado, para escrever lookaheads positivos.
 
-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 negativos, por outro lado, garantem que o padrão especificado não se encontra à sua frente na string. Para usar lookaheads negativos, escrevemos `(?!...)` onde `...` é o padrão que você quer ter certeza que não está lá. O restante do padrão é validado se o padrão do lookahead negativo estiver ausente.
 
-Lookaheads are a bit confusing but some examples will help.
+É fácil se confundir com lookaheads, mas uns exemplos podem ajudar.
 
 ```js
 let quit = "qu";
@@ -27,9 +27,9 @@ quit.match(quRegex);
 noquit.match(qRegex);
 ```
 
-Both of these `match` calls would return `["q"]`.
+As duas chamadas a `match` retornam `["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:
+Validar dois padrões diferentes em uma string é considerado um uso mais prático de lookaheads. Neste não-tão-aprimorado validador de senhas, os lookaheads procuram por 3 a 6 caracteres e pelo menos um número, respectivamente, na string:
 
 ```js
 let password = "abc123";
@@ -39,59 +39,59 @@ checkPass.test(password);
 
 # --instructions--
 
-Use lookaheads in the `pwRegex` to match passwords that are greater than 5 characters long, and have two consecutive digits.
+Faça com que `pwRegex` capture senhas que têm 5 ou mais caracteres e dois dígitos consecutivos usando lookaheads.
 
 # --hints--
 
-Your regex should use two positive `lookaheads`.
+Sua regex deve usar dois `lookaheads` positivos.
 
 ```js
 assert(pwRegex.source.match(/\(\?=.*?\)\(\?=.*?\)/) !== null);
 ```
 
-Your regex should not match the string `astronaut`
+Sua regex não deve encontrar a string `astronaut`
 
 ```js
 assert(!pwRegex.test('astronaut'));
 ```
 
-Your regex should not match the string `banan1`
+Sua regex não deve encontrar a string `banan1`
 
 ```js
 assert(!pwRegex.test('banan1'));
 ```
 
-Your regex should match the string `bana12`
+Sua regex deve encontrar a string `bana12`
 
 ```js
 assert(pwRegex.test('bana12'));
 ```
 
-Your regex should match the string `abc123`
+Sua regex deve encontrar a string `abc123`
 
 ```js
 assert(pwRegex.test('abc123'));
 ```
 
-Your regex should not match the string `12345`
+Sua regex não deve encontrar a string `12345`
 
 ```js
 assert(!pwRegex.test('12345'));
 ```
 
-Your regex should match the string `8pass99`
+Sua regex deve encontrar a string `8pass99`
 
 ```js
 assert(pwRegex.test('8pass99'));
 ```
 
-Your regex should not match the string `1a2bcde`
+Sua regex não deve encontrar a string `1a2bcde`
 
 ```js
 assert(!pwRegex.test('1a2bcde'));
 ```
 
-Your regex should match the string `astr1on11aut`
+Sua regex deve encontrar a string `astr1on11aut`
 
 ```js
 assert(pwRegex.test('astr1on11aut'));
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
index 6caed07bf8..288d08df0d 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dbb367417b2b2512bac
-title: Remove Whitespace from Start and End
+title: Removendo Espaço em Branco do Início e Fim de Strings
 challengeType: 1
 forumTopicId: 301362
 dashedName: remove-whitespace-from-start-and-end
@@ -8,29 +8,29 @@ 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.
+Às vezes, strings têm espaços em branco indesejados em seus inícios e fins. Uma operação muito comum de strings é remover esses espaços ao redor delas.
 
 # --instructions--
 
-Write a regex and use the appropriate string methods to remove whitespace at the beginning and end of strings.
+Escreva uma regex que, junto dos métodos apropriados de string, remove os espaços em branco do começo e do fim delas.
 
-**Note:** The `String.prototype.trim()` method would work here, but you'll need to complete this challenge using regular expressions.
+**Nota:** Normalmente usaríamos `String.prototype.trim()` para isso, mas a sua tarefa é fazer o mesmo usando expressões regulares.
 
 # --hints--
 
-`result` should be equal to the string `Hello, World!`
+`result` deve ser igual a `Hello, World!`
 
 ```js
 assert(result === 'Hello, World!');
 ```
 
-Your solution should not use the `String.prototype.trim()` method.
+Você não deve usar o método `String.prototype.trim()` no seu código.
 
 ```js
 assert(!code.match(/\.?[\s\S]*?trim/));
 ```
 
-The `result` variable should not directly be set to a string
+Você não deve atribuir uma string diretamente à variável `result`
 
 ```js
 assert(!code.match(/result\s*=\s*["'`].*?["'`]/));
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
index e109816c5a..63d8e88d5e 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db8367417b2b2512ba2
-title: Restrict Possible Usernames
+title: Limitando Possíveis Nomes de Usuário
 challengeType: 1
 forumTopicId: 301363
 dashedName: restrict-possible-usernames
@@ -8,97 +8,97 @@ dashedName: restrict-possible-usernames
 
 # --description--
 
-Usernames are used everywhere on the internet. They are what give users a unique identity on their favorite sites.
+Nomes de usuário (usernames) são usados em toda a Internet. São o que fazem com que tenham uma identidade única em seus sites favoritos.
 
-You need to check all the usernames in a database. Here are some simple rules that users have to follow when creating their username.
+Você precisa verificar todos os usernames em um banco de dados. Existem algumas regras que os usuários precisam seguir quando criam os seus usernames.
 
-1) Usernames can only use alpha-numeric characters.
+1) Nomes de usuário só podem conter caracteres alfanuméricos.
 
-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.
+2) Os números, se algum, precisam estar no fim da string. Pode haver zero ou mais números. Usernames não podem começar com números.
 
-3) Username letters can be lowercase and uppercase.
+3) As letras podem ser maiúsculas ou minúsculas.
 
-4) Usernames have to be at least two characters long. A two-character username can only use alphabet letters as characters.
+4) O tamanho de nomes de usuários precisa ser pelo menos dois. Um username de dois caracteres só pode conter letras.
 
 # --instructions--
 
-Change the regex `userCheck` to fit the constraints listed above.
+Modifique a regex `userCheck` para que inclua as regras listadas.
 
 # --hints--
 
-Your regex should match the string `JACK`
+Sua regex deve encontrar a string `JACK`
 
 ```js
 assert(userCheck.test('JACK'));
 ```
 
-Your regex should not match the string `J`
+Sua regex não deve encontrar a string `J`
 
 ```js
 assert(!userCheck.test('J'));
 ```
 
-Your regex should match the string `Jo`
+Sua regex deve encontrar a string `Jo`
 
 ```js
 assert(userCheck.test('Jo'));
 ```
 
-Your regex should match the string `Oceans11`
+Sua regex deve encontrar a string `Oceans11`
 
 ```js
 assert(userCheck.test('Oceans11'));
 ```
 
-Your regex should match the string `RegexGuru`
+Sua regex deve encontrar a string `RegexGuru`
 
 ```js
 assert(userCheck.test('RegexGuru'));
 ```
 
-Your regex should not match the string `007`
+Sua regex não deve encontrar a string `007`
 
 ```js
 assert(!userCheck.test('007'));
 ```
 
-Your regex should not match the string `9`
+Sua regex não deve encontrar a string `9`
 
 ```js
 assert(!userCheck.test('9'));
 ```
 
-Your regex should not match the string `A1`
+Sua regex não deve encontrar a string `A1`
 
 ```js
 assert(!userCheck.test('A1'));
 ```
 
-Your regex should not match the string `BadUs3rnam3`
+Sua regex não deve encontrar a string `BadUs3rnam3`
 
 ```js
 assert(!userCheck.test('BadUs3rnam3'));
 ```
 
-Your regex should match the string `Z97`
+Sua regex deve encontrar a string `Z97`
 
 ```js
 assert(userCheck.test('Z97'));
 ```
 
-Your regex should not match the string `c57bT3`
+Sua regex não deve encontrar a string `c57bT3`
 
 ```js
 assert(!userCheck.test('c57bT3'));
 ```
 
-Your regex should match the string `AB1`
+Sua regex deve encontrar a string `AB1`
 
 ```js
 assert(userCheck.test('AB1'));
 ```
 
-Your regex should not match the string `J%4`
+Sua regex não deve encontrar a string `J%4`
 
 ```js
 assert(!userCheck.test('J%4'))
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
index 2558509c76..c78e7bbead 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dbb367417b2b2512baa
-title: Reuse Patterns Using Capture Groups
+title: Reusando Padrões com Grupos de Captura
 challengeType: 1
 forumTopicId: 301364
 dashedName: reuse-patterns-using-capture-groups
@@ -8,13 +8,13 @@ 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.
+Por vezes você procurará padrões que ocorrem várias vezes em uma string. Não faz sentido repetir a regex manualmente. Existe uma forma muito melhor de especificar quando a string possui múltiplas ocorrências do padrão buscado.
 
-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.
+Você pode usar <dfn>grupos de captura</dfn> para buscar substrings repetidas. Usamos parênteses (`(` e `)`) para criar grupos de captura. Só precisamos escrever a regex do padrão que se repete dentro deles.
 
-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.
+E, para especificar que a string capturada pelo grupo se repetirá, você escreve uma barra invertida (`\`) seguida de um número. Esse número começa por 1 e aumenta em um para cada grupo de captura que você usa. Por exemplo, `\1` captura o primeiro grupo.
 
-The example below matches any word that occurs twice separated by a space:
+No exemplo abaixo, é capturada qualquer palavra que se repita depois de um espaço:
 
 ```js
 let repeatStr = "regex regex";
@@ -23,65 +23,65 @@ repeatRegex.test(repeatStr);
 repeatStr.match(repeatRegex);
 ```
 
-The `test` call would return `true`, and the `match` call would return `["regex regex", "regex"]`.
+Nele, `test` retorna `true` e `match` retorna `["regex regex", "regex"]`.
 
-Using the `.match()` method on a string will return an array with the string it matches, along with its capture group.
+O método `.match()` de uma string retorna um array com a string capturada e cada grupo capturado.
 
 # --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.
+Use grupos de captura na regex `reRegex` para capturar em uma string um número que aparece exatamente três vezes, separados por espaços.
 
 # --hints--
 
-Your regex should use the shorthand character class for digits.
+Sua regex deve usar o atalho de classe de caracteres para dígitos.
 
 ```js
 assert(reRegex.source.match(/\\d/));
 ```
 
-Your regex should reuse a capture group twice.
+Sua regex deve reusar um grupo de captura duas vezes.
 
 ```js
 assert(reRegex.source.match(/\\1|\\2/g).length >= 2);
 ```
 
-Your regex should match the string `42 42 42`.
+Sua regex deve encontrar a string `42 42 42`.
 
 ```js
 assert(reRegex.test('42 42 42'));
 ```
 
-Your regex should match the string `100 100 100`.
+Sua regex deve encontrar a string `100 100 100`.
 
 ```js
 assert(reRegex.test('100 100 100'));
 ```
 
-Your regex should not match the string `42 42 42 42`.
+Sua regex não deve encontrar a 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`.
+Sua regex não deve encontrar a string `42 42`.
 
 ```js
 assert.equal('42 42'.match(reRegex.source), null);
 ```
 
-Your regex should not match the string `101 102 103`.
+Sua regex não deve encontrar a string `101 102 103`.
 
 ```js
 assert(!reRegex.test('101 102 103'));
 ```
 
-Your regex should not match the string `1 2 3`.
+Sua regex não deve encontrar a string `1 2 3`.
 
 ```js
 assert(!reRegex.test('1 2 3'));
 ```
 
-Your regex should match the string `10 10 10`.
+Sua regex deve encontrar a string `10 10 10`.
 
 ```js
 assert(reRegex.test('10 10 10'));
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
index 427d8d6daf..a97abaf33d 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db9367417b2b2512ba7
-title: Specify Exact Number of Matches
+title: Especificando o Número Exato de Capturas
 challengeType: 1
 forumTopicId: 301365
 dashedName: specify-exact-number-of-matches
@@ -8,11 +8,11 @@ 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.
+Você pode especificar um número mínimo e um máximo de capturas com chaves. Às vezes, você só quer um número específico de capturas.
 
-To specify a certain number of patterns, just have that one number between the curly brackets.
+Para especificar este número, apenas escreva-o dentro das chaves.
 
-For example, to match only the word `hah` with the letter `a` `3` times, your regex would be `/ha{3}h/`.
+Por exemplo, você pode escrever a regex `/ha{3}h/` para capturar a letra `a` `3` vezes na string `hah`.
 
 ```js
 let A4 = "haaaah";
@@ -24,49 +24,49 @@ multipleHA.test(A3);
 multipleHA.test(A100);
 ```
 
-In order, the three `test` calls would return `false`, `true`, and `false`.
+As três chamadas a `test` acima retornam, na ordem, os valores: `false`, `true` e `false`.
 
 # --instructions--
 
-Change the regex `timRegex` to match the word `Timber` only when it has four letter `m`'s.
+Modifique a regex `timRegex` para que capture quatro `m`s na string `Timber`.
 
 # --hints--
 
-Your regex should use curly brackets.
+Sua regex deve conter chaves.
 
 ```js
 assert(timRegex.source.match(/{.*?}/).length > 0);
 ```
 
-Your regex should not match the string `Timber`
+Sua regex não deve encontrar a string `Timber`
 
 ```js
 timRegex.lastIndex = 0;
 assert(!timRegex.test('Timber'));
 ```
 
-Your regex should not match the string `Timmber`
+Sua regex não deve encontrar a string `Timmber`
 
 ```js
 timRegex.lastIndex = 0;
 assert(!timRegex.test('Timmber'));
 ```
 
-Your regex should not match the string `Timmmber`
+Sua regex não deve encontrar a string `Timmmber`
 
 ```js
 timRegex.lastIndex = 0;
 assert(!timRegex.test('Timmmber'));
 ```
 
-Your regex should match the string `Timmmmber`
+Sua regex deve encontrar a string `Timmmmber`
 
 ```js
 timRegex.lastIndex = 0;
 assert(timRegex.test('Timmmmber'));
 ```
 
-Your regex should not match the string `Timber` with 30 `m`'s in it.
+Sua regex não deve encontrar a string `Timber` se nela houver 30 `m`s.
 
 ```js
 timRegex.lastIndex = 0;
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
index 358f095a71..5f3e441a4d 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db9367417b2b2512ba6
-title: Specify Only the Lower Number of Matches
+title: Especificando Apenas o Mínimo de Capturas
 challengeType: 1
 forumTopicId: 301366
 dashedName: specify-only-the-lower-number-of-matches
@@ -8,11 +8,11 @@ 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.
+Você pode especificar um número mínimo e um máximo de capturas com chaves. Haverá vezes que você precisará especificar um mínimo mas não um máximo.
 
-To only specify the lower number of patterns, keep the first number followed by a comma.
+Para fazer isso, apenas escreva o número seguido de uma vírgula dentro das chaves.
 
-For example, to match only the string `hah` with the letter `a` appearing at least `3` times, your regex would be `/ha{3,}h/`.
+Por exemplo, para capturar pelo menos `3` vezes a letra `a` na string `hah` você pode escrever a regex `/ha{3,}h/`.
 
 ```js
 let A4 = "haaaah";
@@ -24,51 +24,51 @@ multipleA.test(A2);
 multipleA.test(A100);
 ```
 
-In order, the three `test` calls would return `true`, `false`, and `true`.
+As três chamadas a `test` acima retornam, na ordem, os valores: `true`, `false` e `true`.
 
 # --instructions--
 
-Change the regex `haRegex` to match the word `Hazzah` only when it has four or more letter `z`'s.
+Modifique a regex `haRegex` para que capture quatro ou mais `z`s na string `Hazzah`.
 
 # --hints--
 
-Your regex should use curly brackets.
+Sua regex deve usar chaves.
 
 ```js
 assert(haRegex.source.match(/{.*?}/).length > 0);
 ```
 
-Your regex should not match the string `Hazzah`
+Sua regex não deve encontrar a string `Hazzah`
 
 ```js
 assert(!haRegex.test('Hazzah'));
 ```
 
-Your regex should not match the string `Hazzzah`
+Sua regex não deve encontrar a string `Hazzzah`
 
 ```js
 assert(!haRegex.test('Hazzzah'));
 ```
 
-Your regex should match the string `Hazzzzah`
+Sua regex deve encontrar a string `Hazzzzah`
 
 ```js
 assert('Hazzzzah'.match(haRegex)[0].length === 8);
 ```
 
-Your regex should match the string `Hazzzzzah`
+Sua regex deve encontrar a string `Hazzzzzah`
 
 ```js
 assert('Hazzzzzah'.match(haRegex)[0].length === 9);
 ```
 
-Your regex should match the string `Hazzzzzzah`
+Sua regex deve encontrar a string `Hazzzzzzah`
 
 ```js
 assert('Hazzzzzzah'.match(haRegex)[0].length === 10);
 ```
 
-Your regex should match the string `Hazzah` with 30 `z`'s in it.
+Sua regex deve capturar 30 `z`s, se presentes, na string `Hazzah`.
 
 ```js
 assert('Hazzzzzzzzzzzzzzzzzzzzzzzzzzzzzzah'.match(haRegex)[0].length === 34);
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
index aac7dedad2..d374b306bf 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db9367417b2b2512ba5
-title: Specify Upper and Lower Number of Matches
+title: Especificando o Número de Capturas
 challengeType: 1
 forumTopicId: 301367
 dashedName: specify-upper-and-lower-number-of-matches
@@ -8,11 +8,11 @@ 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.
+Lembre-se que você pode usar o sinal de `+` para procurar por uma ou mais ocorrências e o asterisco `*` para procurar por zero ou mais ocorrências. Eles são convenientes, mas às vezes você precisa capturar um número exato de caracteres.
 
-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.
+Você pode especificar um número mínimo e um máximo de capturas com <dfn>especificadores de quantidade</dfn>. Para usar especificadores de quantidade, usa-se chaves: `{` e `}`. Você pode especificar os dois números dentro delas para restringir as capturas.
 
-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/`.
+Por exemplo, se você quiser encontrar a letra `a` de `3` a `5` vezes na string `ah`, você pode escrever a regex `/a{3,5}h/`.
 
 ```js
 let A4 = "aaaah";
@@ -22,51 +22,51 @@ multipleA.test(A4);
 multipleA.test(A2);
 ```
 
-The first `test` call would return `true`, while the second would return `false`.
+A primeira chamada a `test` retorna `true` enquanto a segunda retorna `false`.
 
 # --instructions--
 
-Change the regex `ohRegex` to match the entire phrase `Oh no` only when it has `3` to `6` letter `h`'s.
+Altere a regex `ohRegex` para que capture a frase `Oh no`, mas apenas quando nela houver de `3` a `6` letras `h`'s.
 
 # --hints--
 
-Your regex should use curly brackets.
+Sua regex deve usar chaves.
 
 ```js
 assert(ohRegex.source.match(/{.*?}/).length > 0);
 ```
 
-Your regex should not match the string `Ohh no`
+Sua regex não deve encontrar a string `Ohh no`
 
 ```js
 assert(!ohRegex.test('Ohh no'));
 ```
 
-Your regex should match the string `Ohhh no`
+Sua regex deve encontrar a string `Ohhh no`
 
 ```js
 assert('Ohhh no'.match(ohRegex)[0].length === 7);
 ```
 
-Your regex should match the string `Ohhhh no`
+Sua regex deve encontrar a string `Ohhhh no`
 
 ```js
 assert('Ohhhh no'.match(ohRegex)[0].length === 8);
 ```
 
-Your regex should match the string `Ohhhhh no`
+Sua regex deve encontrar a string `Ohhhhh no`
 
 ```js
 assert('Ohhhhh no'.match(ohRegex)[0].length === 9);
 ```
 
-Your regex should match the string `Ohhhhhh no`
+Sua regex deve encontrar a string `Ohhhhhh no`
 
 ```js
 assert('Ohhhhhh no'.match(ohRegex)[0].length === 10);
 ```
 
-Your regex should not match the string `Ohhhhhhh no`
+Sua regex não deve encontrar a string `Ohhhhhhh no`
 
 ```js
 assert(!ohRegex.test('Ohhhhhhh no'));
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
index 6b1d6b0592..5be46ff32c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dbb367417b2b2512bab
-title: Use Capture Groups to Search and Replace
+title: Use Grupos de Captura para Buscar e Substituir
 challengeType: 1
 forumTopicId: 301368
 dashedName: use-capture-groups-to-search-and-replace
@@ -8,9 +8,9 @@ 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.
+Buscar texto é útil. É ainda mais útil quando você consegue modificar (ou substituir) o texto que você busca.
 
-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.
+Você pode buscar e substituir texto em uma string usando o método `.replace()`. O primeiro parâmetro do `.replace()` é o padrão regex que você quer procurar. O segundo parâmetro é a string que substituirá o resultado da busca ou uma função que fará algo com ele.
 
 ```js
 let wrongText = "The sky is silver.";
@@ -18,47 +18,47 @@ let silverRegex = /silver/;
 wrongText.replace(silverRegex, "blue");
 ```
 
-The `replace` call would return the string `The sky is blue.`.
+A chamada a `replace` aqui retorna a string `The sky is blue.`.
 
-You can also access capture groups in the replacement string with dollar signs (`$`).
+Você também pode acessar grupos de captura na string de substituição usando o cifrão (`$`).
 
 ```js
 "Code Camp".replace(/(\w+)\s(\w+)/, '$2 $1');
 ```
 
-The `replace` call would return the string `Camp Code`.
+A chamada a `replace` aqui retorna a 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.
+Escreva uma regex, `fixRegex`, que usa três grupos de captura para procurar cada palavra na string `one two three`. Depois atualize a variável `replaceText` para trocar de `one two three` para `three two one` e atribuir o resultado à variável `result`. Certifique-se de estar utilizando grupos de captura na string de substituição usando o cifrão (`$`).
 
 # --hints--
 
-You should use `.replace()` to search and replace.
+Você deve usar `.replace()` para buscar e substituir.
 
 ```js
 assert(code.match(/\.replace\(.*\)/));
 ```
 
-Your regex should change the string `one two three` to the string `three two one`
+Sua regex deve mudar a string `one two three` para `three two one`
 
 ```js
 assert(result === 'three two one');
 ```
 
-You should not change the last line.
+Você não deve alterar a última linha.
 
 ```js
 assert(code.match(/result\s*=\s*str\.replace\(.*?\)/));
 ```
 
-`fixRegex` should use at least three capture groups.
+`fixRegex` deve usar pelo menos três grupos de captura.
 
 ```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).
+`replaceText` deve usar os grupos de captura por via da sintaxe $n onde n é o n-ésimo grupo capturado.
 
 ```js
 {
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
index dddb321ec5..11b88b912c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7db3367417b2b2512b8e
-title: Using the Test Method
+title: Usando o Método Test
 challengeType: 1
 forumTopicId: 301369
 dashedName: using-the-test-method
@@ -8,11 +8,11 @@ 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.
+Expressões regulares são usadas em linguagens de programação para encontrar e extrair partes de strings. Cria-se padrões que ajudam a encontrar tais partes.
 
-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.
+Se você quiser encontrar a palavra `the` na string `The dog chased the cat`, você poderia usar a seguinte expressão regular: `/the/`. Note que aspas não são necessárias ao redor da expressão regular.
 
-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.
+O JavaScript oferece múltiplas maneiras de usar <dfn>regexes</dfn>. Uma dessas maneiras é com o método `.test()`. O método `.test()` aplica a regex à string dentro dos parênteses e retorna `true` caso encontre o padrão ou `false` caso contrário.
 
 ```js
 let testStr = "freeCodeCamp";
@@ -20,21 +20,21 @@ let testRegex = /Code/;
 testRegex.test(testStr);
 ```
 
-The `test` method here returns `true`.
+O método `test` retorna `true` aqui.
 
 # --instructions--
 
-Apply the regex `myRegex` on the string `myString` using the `.test()` method.
+Aplique a regex `myRegex` na string `myString` usando o método `.test()`.
 
 # --hints--
 
-You should use `.test()` to test the regex.
+Você deve usar `.test()` para testar a regex.
 
 ```js
 assert(code.match(/myRegex.test\(\s*myString\s*\)/));
 ```
 
-Your result should return `true`.
+O resultado deve ser `true`.
 
 ```js
 assert(result === true);
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
index b1b057082d..e0e65633e3 100644
--- 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
@@ -14,7 +14,7 @@ Aninhe três elementos `button` dentro de cada um de seus elementos `div` conten
 
 # --hints--
 
-Three `button` elements should be nested within each of your `div` elements with class `well`.
+Três elementos `button` devem ser aninhados dentro de cada um de seus elementos `div` com a classe `well`.
 
 ```js
 assert(
@@ -23,13 +23,13 @@ assert(
 );
 ```
 
-You should have a total of 6 `button` elements.
+Você deve ter o total de 6 elementos `button`.
 
 ```js
 assert($('button') && $('button').length > 5);
 ```
 
-All of your `button` elements should have closing tags.
+Todos os seus elementos `button` deve conter tag de fechamento.
 
 ```js
 assert(
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
index df7787bf53..9294949164 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aedc08845
-title: Add Font Awesome Icons to all of our Buttons
+title: Adicione Ícones de Font Awesome para todos os seus botões
 challengeType: 0
 forumTopicId: 16637
 required:
@@ -12,17 +12,17 @@ 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.
+Font Awesome é uma biblioteca conveniente de ícones. Estes ícones podem ser fontes da web ou gráficos vetoriais. Estes ícones são tratados assim como as fontes. Você pode especificar seu tamanho utilizando pixels, e eles irão assumir o tamanho de fonte de seus elementos HTML parentes.
 
 # --instructions--
 
-Use Font Awesome to add an `info-circle` icon to your info button and a `trash` icon to your delete button.
+Utilize Font Awesome para adicionar um ícone `info-circle` para o seu botão de informação e um ícone `trash` para o seu botão de deleção.
 
-**Note:** The `span` element is an acceptable alternative to the `i` element for the directions below.
+**Nota:** O elemento `span` é uma alternativa aceitável ao elemento `i` para as instruções abaixo.
 
 # --hints--
 
-You should add a `<i class="fas fa-info-circle"></i>` within your `info` button element.
+Você deve adicionar um `<i class="fas fa-info-circle"></i>` dentro do seu elemento de botão `info`.
 
 ```js
 assert(
@@ -31,7 +31,7 @@ assert(
 );
 ```
 
-You should add a `<i class="fas fa-trash"></i>` within your `delete` button element.
+Você deve adicionar um `<i class="fas fa-trash"></i>` dentro do seu elemento de botão `delete`.
 
 ```js
 assert(
@@ -40,7 +40,7 @@ assert(
 );
 ```
 
-Each of your `i` elements should have a closing tag and `<i class="fas fa-thumbs-up"></i>` is in your `like` button element.
+Cada um de seus elementos `i` deve ter uma tag de fechamento e `<i class="fas fa-thumbs-up"></i>` está em seu elemento de botão `like`.
 
 ```js
 assert(
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
index 54ec6ddc57..d852fc307a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aedd08845
-title: Add Font Awesome Icons to our Buttons
+title: Adicione Ícones de Font Awesome para nossos botões
 challengeType: 0
 forumTopicId: 16638
 required:
@@ -12,37 +12,37 @@ 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.
+Font Awesome é uma biblioteca conveniente de ícones. Estes ícones podem ser fontes da web ou gráficos vetoriais. Estes ícones são tratados assim como as fontes. Você pode especificar seu tamanho utilizando pixels, e eles irão assumir o tamanho de fonte de seus elementos HTML parentes.
 
-You can include Font Awesome in any app by adding the following code to the top of your HTML:
+Você pode incluir o Font Awesome em qualquer aplicativo, adicionando o seguinte código ao topo do seu 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.
+Neste caso, já o adicionamos para você a esta página por trás dos panos.
 
-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:
+O elemento `i` foi usado originalmente para fazer outros elementos itálicos, mas agora é comumente usado para ícones. Você pode adicionar as classes Font Awesome ao elemento `i` para transformá-lo em um ícone, por exemplo:
 
 ```html
 <i class="fas fa-info-circle"></i>
 ```
 
-Note that the `span` element is also acceptable for use with icons.
+Observe que o elemento `span` também é aceitável para uso com ícones.
 
 # --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.
+Use o Font Awesome para adicionar um ícone `thumbs-up` ao seu botão like, doando-o um elemento `i` com as classes `fas` e `fa-thumbs-up`. Certifique-se de manter o texto `Like` ao lado do ícone.
 
 # --hints--
 
-You should add an `i` element with the classes `fas` and `fa-thumbs-up`.
+Você deve adicionar um elemento `i` com as classes `fas` e `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.
+Seu ícone `fa-thumbs-up` deve estar localizado dentro do botão Like.
 
 ```js
 assert(
@@ -53,7 +53,7 @@ assert(
 );
 ```
 
-Your `i` element should be nested within your `button` element.
+Seu elemento `i` deve estar dentro de seu novo elemento `button`.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-Your icon element should have a closing tag.
+Seu elemento de ícone deve ter uma tag de fechamento.
 
 ```js
 assert(code.match(/<\/i>|<\/span>/g));
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
index 66b46cd625..b3cc753c45 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908853
-title: Add id Attributes to Bootstrap Elements
+title: Addicone Atributos id aos Elementos Bootstrap
 challengeType: 0
 forumTopicId: 16639
 dashedName: add-id-attributes-to-bootstrap-elements
@@ -8,23 +8,23 @@ 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.
+Lembre que, além dos atributos de classe, você pode dar a cada um de seus elementos um atributo `id`.
 
-Each id must be unique to a specific element and used only once per page.
+Cada id precisa ser único para um elemento específico e utilizado apenas uma vez por página.
 
-Let's give a unique id to each of our `div` elements of class `well`.
+Vamos dar um id único para cada um de nossos elementos `div` com classe `well`.
 
-Remember that you can give an element an id like this:
+Lembre-se que você pode dar um id a um elemento dessa forma:
 
 ```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`.
+Dê ao well a esquerda o id `left-well`. Dê ao well a direita o id `right-well`.
 
 # --hints--
 
-Your left `well` should have the id of `left-well`.
+Seu `well` da esquerda deve ter o id `left-well`.
 
 ```js
 assert(
@@ -33,7 +33,7 @@ assert(
 );
 ```
 
-Your right `well` should have the id of `right-well`.
+Seu `well` da direita deve ter o id `right-well`.
 
 ```js
 assert(
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
index 4ec8c688fc..7f1044be26 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908850
-title: Apply the Default Bootstrap Button Style
+title: Aplique o Estilo de Botão Padrão do Bootstrap
 challengeType: 0
 forumTopicId: 16657
 dashedName: apply-the-default-bootstrap-button-style
@@ -8,19 +8,19 @@ dashedName: apply-the-default-bootstrap-button-style
 
 # --description--
 
-Bootstrap has another button class called `btn-default`.
+Bootstrap tem outra classe de botão chamada `btn-default`.
 
-Apply both the `btn` and `btn-default` classes to each of your `button` elements.
+Aplique ambas as classes `btn` e `btn-default` para cada um de seus elementos `button`.
 
 # --hints--
 
-You should apply the `btn` class to each of your `button` elements.
+Você deve aplicar a classe `btn` para cada um de seus elementos `button`.
 
 ```js
 assert($('.btn').length > 5);
 ```
 
-You should apply the `btn-default` class to each of your `button` elements.
+Você deve aplicar a classe `btn-default` para cada um de seus elementos `button`.
 
 ```js
 assert($('.btn-default').length > 5);
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
index 50f3b1dbd7..800caaf5f1 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348cd8acef08813
-title: Call out Optional Actions with btn-info
+title: Chame Ações Opcionais com btn-info
 challengeType: 0
 forumTopicId: 16770
 dashedName: call-out-optional-actions-with-btn-info
@@ -8,33 +8,33 @@ 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.
+Bootstrap vem com várias cores pré-definidas para botões. A classe `btn-info` é usada para chamar atenção para ações opcionais que o usuário pode tomar.
 
-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.
+Crie um novo botão do Bootstrap no nível de blocos abaixo do seu botão `Like` com o texto `Info`, e adicione as classes `btn-info` e `btn-block` do Bootstrap a ele.
 
-Note that these buttons still need the `btn` and `btn-block` classes.
+Observe que esses botões ainda precisam das classes `btn` e `btn-block`.
 
 # --hints--
 
-You should create a new `button` element with the text `Info`.
+Você deve criar um novo elemento `button` com o texto `Info`.
 
 ```js
 assert(new RegExp('info', 'gi').test($('button').text()));
 ```
 
-Both of your Bootstrap buttons should have the `btn` and `btn-block` classes.
+Ambos os seus botões Bootstrap devem ter as classes `btn` e `btn-block`.
 
 ```js
 assert($('button.btn-block.btn').length > 1);
 ```
 
-Your new button should have the class `btn-info`.
+Seu novo botão deve ter a classe `btn-info`.
 
 ```js
 assert($('button').hasClass('btn-info'));
 ```
 
-All of your `button` elements should have closing tags.
+Todos os seus elementos `button` deve ter tags de fechamento.
 
 ```js
 assert(
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
index 9aeceadaa1..56b7821fba 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd8acde08812
-title: Center Text with Bootstrap
+title: Centralize Texto com Bootstrap
 challengeType: 0
 forumTopicId: 16771
 dashedName: center-text-with-bootstrap
@@ -8,9 +8,9 @@ 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.
+Agora que estamos usando Bootstrap, podemos centralizar nossos elementos de cabeçalho para deixá-los com melhor aparência. Tudo que precisamos fazer é adicionar a classe `text-center` para o nosso elemento `h2`.
 
-Remember that you can add several classes to the same element by separating each of them with a space, like this:
+Lembre-se que você pode adicionar diversas classes para o mesmo elemento ao separar cada classe com um espaço, dessa forma:
 
 ```html
 <h2 class="red-text text-center">your text</h2>
@@ -18,13 +18,13 @@ Remember that you can add several classes to the same element by separating each
 
 # --hints--
 
-Your `h2` element should be centered by applying the class `text-center`
+Seu elemento `h2` deve estar centralizado ao aplicar a classe `text-center`
 
 ```js
 assert($('h2').hasClass('text-center'));
 ```
 
-Your `h2` element should still have the class `red-text`
+Seu elemento `h2` ainda deve ter a classe `red-text`
 
 ```js
 assert($('h2').hasClass('red-text'));
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
index 1573a5fc26..d463f1db39 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348cd8acef08812
-title: Create a Block Element Bootstrap Button
+title: Criar um elemento botão de bloco de Bootstrap
 challengeType: 0
 forumTopicId: 16810
 dashedName: create-a-block-element-bootstrap-button
@@ -8,45 +8,45 @@ 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:
+Normalmente, seus elementos `button` com as classes `btn` e `btn-default` são apenas tão grandes quanto os textos que eles contêm. Por exemplo:
 
 ```html
 <button class="btn btn-default">Submit</button>
 ```
 
-This button would only be as wide as the word `Submit`.
+Este botão seria apenas tão largo quanto a palavra `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.
+Tornando-os elementos de bloco com a classe adicional `btn-block`, seu botão irá esticar para preencher todo o espaço horizontal da sua página e qualquer elemento seguinte irá fluir para uma nova linha abaixo do bloco.
 
 ```html
 <button class="btn btn-default btn-block">Submit</button>
 ```
 
-This button would take up 100% of the available width.
+Esse botão ocuparia 100% da largura disponível.
 
 <button class='btn btn-default btn-block'>Submit</button>
 
-Note that these buttons still need the `btn` class.
+Note que esses botões ainda precisam da classe `btn`.
 
-Add Bootstrap's `btn-block` class to your Bootstrap button.
+Adicione classe `btn-block` do Bootstrap para seu botão Bootstrap.
 
 # --hints--
 
-Your button should still have the `btn` and `btn-default` classes.
+Seu botão ainda deveria ter as classes `btn` e `btn-default`.
 
 ```js
 assert($('button').hasClass('btn') && $('button').hasClass('btn-default'));
 ```
 
-Your button should have the class `btn-block`.
+Seu botão deve ter a classe `btn-block`.
 
 ```js
 assert($('button').hasClass('btn-block'));
 ```
 
-All of your `button` elements should have closing tags.
+Todos os seus elementos `button` devem ter tags de fechamento.
 
 ```js
 assert(
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
index 3014dc6931..c6a9b5ee81 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348cd8acdf08812
-title: Create a Bootstrap Button
+title: Crie um Botão Bootstrap
 challengeType: 0
 forumTopicId: 16811
 dashedName: create-a-bootstrap-button
@@ -8,13 +8,13 @@ dashedName: create-a-bootstrap-button
 
 # --description--
 
-Bootstrap has its own styles for `button` elements, which look much better than the plain HTML ones.
+O Bootstrap possui seus próprios estilos para elementos `button`, os quais ficam muito melhores do que aqueles botões em HTML puro.
 
-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`.
+Crie um novo elemento `button` abaixo da sua grande foto de gatinho. Dê a ele as classes `btn` e `btn-default`, assim como o texto `Like`.
 
 # --hints--
 
-You should create a new `button` element with the text `Like`.
+Você deve criar um novo elemento `button` com o texto `Like`.
 
 ```js
 assert(
@@ -23,13 +23,13 @@ assert(
 );
 ```
 
-Your new button should have two classes: `btn` and `btn-default`.
+Seu novo botão deve ter duas classes: `btn` e `btn-default`.
 
 ```js
 assert($('button').hasClass('btn') && $('button').hasClass('btn-default'));
 ```
 
-All of your `button` elements should have closing tags.
+Todos os seus elementos `button` devem ter tags de fechamento.
 
 ```js
 assert(
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
index 5292646446..5ebc4684d1 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908846
-title: Create a Bootstrap Headline
+title: Crie um Título Bootstrap
 challengeType: 0
 forumTopicId: 16812
 dashedName: create-a-bootstrap-headline
@@ -8,23 +8,23 @@ dashedName: create-a-bootstrap-headline
 
 # --description--
 
-Now let's build something from scratch to practice our HTML, CSS and Bootstrap skills.
+Agora vamos construir algo do zero para praticar nossa habilidade em HTML, CSS e Bootstrap.
 
-We'll build a jQuery playground, which we'll soon put to use in our jQuery challenges.
+Iremos construir um playground JQuery, o qual iremos em breve colocar em uso nos nos desafios JQuery.
 
-To start with, create an `h3` element, with the text `jQuery Playground`.
+Para começar, crie um elemento `h3`, com o texto `JQuery Playground`.
 
-Color your `h3` element with the `text-primary` Bootstrap class, and center it with the `text-center` Bootstrap class.
+Colore seu elemento `h3` com a classe Bootstrap `text-primary`, e centralize-o com a classe Bootstrap `text-center`.
 
 # --hints--
 
-You should add an `h3` element to your page.
+Você deve adicionar um elemento `h3` para sua página.
 
 ```js
 assert($('h3') && $('h3').length > 0);
 ```
 
-Your `h3` element should have a closing tag.
+Seu elemento `h3` deve ter uma tag de fechamento.
 
 ```js
 assert(
@@ -34,19 +34,19 @@ assert(
 );
 ```
 
-Your `h3` element should be colored by applying the class `text-primary`
+Seu elemento `h3` deve ser colorido ao aplicar a classe `text-primary`
 
 ```js
 assert($('h3').hasClass('text-primary'));
 ```
 
-Your `h3` element should be centered by applying the class `text-center`
+Seu elemento `h3` deve ser centralizado ao aplicar a classe `text-center`
 
 ```js
 assert($('h3').hasClass('text-center'));
 ```
 
-Your `h3` element should have the text `jQuery Playground`.
+Seu elemento `h3` deve ter o texto `JQuery Playground`.
 
 ```js
 assert.isTrue(/jquery(\s)+playground/gi.test($('h3').text()));
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
index 3a5ff315bb..5c40ae6ea4 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9bec908846
-title: Create a Bootstrap Row
+title: Crie uma Linha Bootstrap
 challengeType: 0
 forumTopicId: 16813
 dashedName: create-a-bootstrap-row
@@ -8,13 +8,13 @@ dashedName: create-a-bootstrap-row
 
 # --description--
 
-Now we'll create a Bootstrap row for our inline elements.
+Agora iremos criar uma linha Bootstrap para nossos elementos em linha.
 
-Create a `div` element below the `h3` tag, with a class of `row`.
+Crie um elemento `div` abaixo da tag `h3`, com a classe `row`.
 
 # --hints--
 
-You should add a `div` element below your `h3` element.
+Você deve adicionar o elemento `div` abaixo do seu elemento `h3`.
 
 ```js
 assert(
@@ -25,19 +25,19 @@ assert(
 );
 ```
 
-Your `div` element should have the class `row`
+Seu elemento `div` deve ter a classe `row`
 
 ```js
 assert($('div').hasClass('row'));
 ```
 
-Your `row div` should be nested inside the `container-fluid div`
+Seu `row div` deve estar aninhado dentro de `container-fluid div`
 
 ```js
 assert($('div.container-fluid div.row').length > 0);
 ```
 
-Your `div` element should have a closing tag.
+Seu elemento `div` deve ter uma tag de fechamento.
 
 ```js
 assert(
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
index eaea933735..954774e7a5 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908852
-title: Create a Class to Target with jQuery Selectors
+title: Crie uma Classe para Selecionar com JQuery Selectors
 challengeType: 0
 forumTopicId: 16815
 dashedName: create-a-class-to-target-with-jquery-selectors
@@ -8,13 +8,13 @@ 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.
+Nem todas as classes precisam ter um CSS correspondente. As vezes criamos classes apenas com o propósito de selecionar esses elementos de forma mais fácil usando JQuery.
 
-Give each of your `button` elements the class `target`.
+De a cada um de seus elementos `button` a classe `target`.
 
 # --hints--
 
-You should apply the `target` class to each of your `button` elements.
+Você deve aplicar a classe `target` para cada um de seus elementos `button`.
 
 ```js
 assert($('.target').length > 5);
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
index 646afcbe0f..bcd6b43a5a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aede08845
-title: Create a Custom Heading
+title: Crie um Título Personalizado
 challengeType: 0
 forumTopicId: 16816
 dashedName: create-a-custom-heading
@@ -8,23 +8,23 @@ 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.
+Iremos fazer um simples título para nossa foto de gato ao colocar o título e a imagem do gato relaxando na mesma linha.
 
-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.
+Lembre-se, Bootstrap usa o sistema de rede responsiva, o que torna fácil colocar elementos em linhas e especificar cada largura relativa de um elemento. A maioria das classes Bootstrap podem ser aplicadas a um elemento `div`.
 
-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.
+Aninhe sua primeira imagem e seu elemento `h2` dentro de um único elemento `<div class="row">`. Aninhe o seu elemento `h2` dentro de uma `<div class="col-xs-8">` e sua imagem em uma `<div class="col-xs-4">` para que eles estejam na mesma linha.
 
-Notice how the image is now just the right size to fit along the text?
+Notou como a imagem agora está no tamanho exato para encaixar com o texto?
 
 # --hints--
 
-Your `h2` element and topmost `img` element should both be nested together within a `div` element with the class `row`.
+Seu elemento `h2` e o elemento `img` mais a cima devem ambos estarem aninhados juntos dentro de um elemento `div` com a classe `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`.
+Seu elemento `img` superior deve estar aninhado dentro de uma `div` com a classe `col-xs-4`.
 
 ```js
 assert(
@@ -33,7 +33,7 @@ assert(
 );
 ```
 
-Your `h2` element should be nested within a `div` with the class `col-xs-8`.
+Seu elemento `h2` deve estar aninhado dentro de uma `div` com a classe `col-xs-8`.
 
 ```js
 assert(
@@ -42,7 +42,7 @@ assert(
 );
 ```
 
-All of your `div` elements should have closing tags.
+Todos os seus elementos `div` devem ter tags de fechamento.
 
 ```js
 assert(
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
index 47de1536d6..70a9fee0aa 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908848
-title: Create Bootstrap Wells
+title: Crie Poços Bootstrap
 challengeType: 0
 forumTopicId: 16825
 dashedName: create-bootstrap-wells
@@ -8,25 +8,25 @@ dashedName: create-bootstrap-wells
 
 # --description--
 
-Bootstrap has a class called `well` that can create a visual sense of depth for your columns.
+Bootstrap tem uma classe chamada `well` que podem criar uma sensação visual de profundidade para suas colunas.
 
-Nest one `div` element with the class `well` within each of your `col-xs-6` `div` elements.
+Aninhe um elemento `div` com a classe `well` dentro de cada um de seus elementos `col-xs-6` `div`.
 
 # --hints--
 
-You should add a `div` element with the class `well` inside each of your `div` elements with the class `col-xs-6`
+Você deve adicionar um elemento `div` com a classe `well` dentro de cada um de seus elementos `div` com a classe `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`.
+Ambos os seus elementos `div` com a classe `col-xs-6` deve estar aninhados dentro de seu elemento `div` com a classe `row`.
 
 ```js
 assert($('div.row > div.col-xs-6').length > 1);
 ```
 
-All your `div` elements should have closing tags.
+Todos os seus elementos `div` devem ter tags de fechamento.
 
 ```js
 assert(
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
index 76a1bffcd7..b36efd2270 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1347bd9aedf08845
-title: Ditch Custom CSS for Bootstrap
+title: Livre-se de CSS customizado para Bootstrap
 challengeType: 0
 forumTopicId: 17565
 dashedName: ditch-custom-css-for-bootstrap
@@ -8,31 +8,31 @@ 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.
+Nós podemos limpar nosso código e fazer o aplicativo de fotos de gato parecer mais convencional ao utilizar os estilos nativos do Bootstrap ao invés dos estilos customizados que criamos mais cedo.
 
-Don't worry - there will be plenty of time to customize our CSS later.
+Não se preocupe - haverá muito tempo para customizar nosso CSS depois.
 
-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`.
+Delete as declarações CSS `.red-text`, `p` e `.smaller-image` de seu elemento `style` para que as únicas declarações restantes em seu elemento `style` sejam `h2` e `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.
+Em seguida, delete o elemento `p` que contem um link morto. Em seguida, remova a classe `red-text` do seu elemento `h2` e substitua-o com a classe Bootstrap `text-primary`.
 
-Finally, remove the `smaller-image` class from your first `img` element and replace it with the `img-responsive` class.
+Finalmente, remova a classe `smaller-image` do seu primeiro elemento `img` e substitua o com a classe `img-responsive`.
 
 # --hints--
 
-Your `h2` element should no longer have the class `red-text`.
+Seu elemento `h2` não deve mais conter a classe `red-text`.
 
 ```js
 assert(!$('h2').hasClass('red-text'));
 ```
 
-Your `h2` element should now have the class `text-primary`.
+Seu elemento `h2` deve ter agora a classe `text-primary`.
 
 ```js
 assert($('h2').hasClass('text-primary'));
 ```
 
-Your paragraph elements should no longer use the font `Monospace`.
+Seus elementos de parágrafo não devem mais usar a fonte `Monospace`.
 
 ```js
 assert(
@@ -42,13 +42,13 @@ assert(
 );
 ```
 
-The `smaller-image` class should be removed from your top image.
+A classe `smaller-image` deve ser removida da sua imagem superior.
 
 ```js
 assert(!$('img').hasClass('smaller-image'));
 ```
 
-You should add the `img-responsive` class to your top image.
+Você deve adicionar a classe `img-responsive` para sua imagem superior.
 
 ```js
 assert($('.img-responsive').length > 1);
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
index 290766d634..d541f7c56a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908855
-title: Give Each Element a Unique id
+title: Dê a Cada Elemento um id Único
 challengeType: 0
 forumTopicId: 18191
 dashedName: give-each-element-a-unique-id
@@ -8,15 +8,15 @@ 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.
+Nós também queremos ser capazes de usar JQuery para selecionar cada botão a partir do seu id único.
 
-Give each of your buttons a unique id, starting with `target1` and ending with `target6`.
+Dê a cada um dos seus botões um id único, começando com `target1` e terminando com `target6`.
 
-Make sure that `target1` to `target3` are in `#left-well`, and `target4` to `target6` are in `#right-well`.
+Certifique-se de que `target1` até `target3` estão em `#left-well`, e `target4` até `target6` estão em `#right well`.
 
 # --hints--
 
-One `button` element should have the id `target1`.
+Um elemento `button` teve ter o id `target1`.
 
 ```js
 assert(
@@ -25,7 +25,7 @@ assert(
 );
 ```
 
-One `button` element should have the id `target2`.
+Um elemento `button` teve ter o id `target2`.
 
 ```js
 assert(
@@ -34,7 +34,7 @@ assert(
 );
 ```
 
-One `button` element should have the id `target3`.
+Um elemento `button` teve ter o id `target3`.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-One `button` element should have the id `target4`.
+Um elemento `button` teve ter o id `target4`.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-One `button` element should have the id `target5`.
+Um elemento `button` teve ter o id `target5`.
 
 ```js
 assert(
@@ -61,7 +61,7 @@ assert(
 );
 ```
 
-One `button` element should have the id `target6`.
+Um elemento `button` teve ter o id `target6`.
 
 ```js
 assert(
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
index 452f52ab47..f6c24d0cae 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908746
-title: House our page within a Bootstrap container-fluid div
+title: Hospede nossa página em um div de contêiner fluido de Bootstrap
 challengeType: 0
 forumTopicId: 18198
 dashedName: house-our-page-within-a-bootstrap-container-fluid-div
@@ -8,19 +8,19 @@ 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.
+Agora vamos garantir que todo o conteúdo na sua página seja responsivo a dispositivo móveis.
 
-Let's nest your `h3` element within a `div` element with the class `container-fluid`.
+Vamos aninhar nosso elemento `h3` dentro de um elemento `div` com a classe `container-fluid`.
 
 # --hints--
 
-Your `div` element should have the class `container-fluid`.
+Seu elemento `div` teve ter a classe `container-fluid`.
 
 ```js
 assert($('div').hasClass('container-fluid'));
 ```
 
-Each of your `div` elements should have closing tags.
+Cada um de seus elementos `div` devem ter tags de fechamento.
 
 ```js
 assert(
@@ -30,7 +30,7 @@ assert(
 );
 ```
 
-Your `h3` element should be nested inside a `div` element.
+Seu elemento `h3` deve estar aninhando dentro de um elemento `div`.
 
 ```js
 assert($('div').children('h3').length > 0);
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
index 6d995aa318..3f4c89ac0b 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908856
-title: Label Bootstrap Buttons
+title: Dê um Label a Botões Bootstrap
 challengeType: 0
 forumTopicId: 18222
 dashedName: label-bootstrap-buttons
@@ -8,43 +8,43 @@ dashedName: label-bootstrap-buttons
 
 # --description--
 
-Just like we labeled our wells, we want to label our buttons.
+Assim como nós rotulamos nossos wells, nós queremos rotular (label) nossos botões.
 
-Give each of your `button` elements text that corresponds to its id selector.
+Dê o texto a cada um de seus elementos `button` que corresponde ao seletor id.
 
 # --hints--
 
-Your `button` element with the id `target1` should have the text `#target1`.
+Seu elemento `button` com o id `target1` teve ter o texto `#target1`.
 
 ```js
 assert(new RegExp('#target1', 'gi').test($('#target1').text()));
 ```
 
-Your `button` element with the id `target2` should have the text `#target2`.
+Seu elemento `button` com o id `target2` deve ter o texto `#target2`.
 
 ```js
 assert(new RegExp('#target2', 'gi').test($('#target2').text()));
 ```
 
-Your `button` element with the id `target3` should have the text `#target3`.
+Seu elemento `button` com o id `target3` deve ter o texto `#target3`.
 
 ```js
 assert(new RegExp('#target3', 'gi').test($('#target3').text()));
 ```
 
-Your `button` element with the id `target4` should have the text `#target4`.
+Seu elemento `button` com o id `target4` deve ter o texto `#target4`.
 
 ```js
 assert(new RegExp('#target4', 'gi').test($('#target4').text()));
 ```
 
-Your `button` element with the id `target5` should have the text `#target5`.
+Seu elemento `button` com o id `target5` deve ter o texto `#target5`.
 
 ```js
 assert(new RegExp('#target5', 'gi').test($('#target5').text()));
 ```
 
-Your `button` element with the id `target6` should have the text `#target6`.
+Seu elemento `button` com o id `target6` deve ter o texto `#target6`.
 
 ```js
 assert(new RegExp('#target6', 'gi').test($('#target6').text()));
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
index cae4c4837f..dec0573596 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908854
-title: Label Bootstrap Wells
+title: Dê um Label a Wells Bootstrap
 challengeType: 0
 forumTopicId: 18223
 dashedName: label-bootstrap-wells
@@ -8,15 +8,15 @@ dashedName: label-bootstrap-wells
 
 # --description--
 
-For the sake of clarity, let's label both of our wells with their ids.
+Pelo bem da clareza, vamos rotular ambos os nossos wells com seus ids.
 
-Above your left-well, inside its `col-xs-6` `div` element, add a `h4` element with the text `#left-well`.
+Acima do seu well da esquerda, dentro de seu elemento `col-xs-6` `div`, adicione um elemento `h4` com o texto `#left-well`.
 
-Above your right-well, inside its `col-xs-6` `div` element, add a `h4` element with the text `#right-well`.
+Acima do seu well da direita, dentro de seu elemento `col-xs-6` `div`, adicione um elemento `h4` com o texto `#right-well`.
 
 # --hints--
 
-You should add an `h4` element to each of your `<div class="col-xs-6">` elements.
+Você deve adicionar um elemento `h4` para cada um de seus elementos `<div class="col-xs-6">`.
 
 ```js
 assert(
@@ -24,19 +24,19 @@ assert(
 );
 ```
 
-One `h4` element should have the text `#left-well`.
+Um elemento `h4` deve ter o texto `#left-well`.
 
 ```js
 assert(new RegExp('#left-well', 'gi').test($('h4').text()));
 ```
 
-One `h4` element should have the text `#right-well`.
+Um elemento `h4` deve ter o texto `#right-well`.
 
 ```js
 assert(new RegExp('#right-well', 'gi').test($('h4').text()));
 ```
 
-All of your `h4` elements should have closing tags.
+Todos os seus elementos `h4` devem ter tags de fechamento.
 
 ```js
 assert(
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
index b6037f8333..5b6e8b2152 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908845
-title: Line up Form Elements Responsively with Bootstrap
+title: Alinhe os Elementos de Formulário de maneira Responsiva com o Bootstrap
 challengeType: 0
 forumTopicId: 18225
 required:
@@ -13,15 +13,15 @@ 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.
+Agora vamos colocar o seu `input` e o `button` de submissão do formulário na mesma linha. Faremos isso da mesma forma que fizemos antes: usando um elemento `div` com a classe `row`, e outros elementos `div` dentro do primeiro div usando a classe `col-xs-*`.
 
-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`.
+Aninhe ambos o `input` de texto e o `button` de submissão do formulário dentro de uma `div` com a classe `row`. Aninhe o texto do `input` do formulário dentro de uma div com a classe `col-xs-7`. Aninhe o seu `button` de submissão do formulário em uma `div` com a classe `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!
+Esse é o último desafio que faremos para nossa aplicação Foto de Gato por agora. Esperamos que você tenha gostado de aprender Font Awesome, Bootstrap e design responsivo!
 
 # --hints--
 
-Your form submission button and text input should be nested in a div with class `row`.
+Seu botão de submissão e o input de texto do formulário devem estar aninhados dentro de uma div com a classe `row`.
 
 ```js
 assert(
@@ -30,19 +30,19 @@ assert(
 );
 ```
 
-Your form text input should be nested in a div with the class `col-xs-7`.
+Seu input de texto do formulário deve estar aninhado dentro de uma div com a classe `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`.
+Seu botão de submissão do formulário deve estar aninhado dentro de uma div com a classe `col-xs-5`.
 
 ```js
 assert($('div.col-xs-5:has(button[type="submit"])').length > 0);
 ```
 
-All of your `div` elements should have closing tags.
+Todos os seus elementos `div` devem ter tags de fechamento.
 
 ```js
 assert(
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
index 54c1ec8e26..02042e2b27 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9acde08812
-title: Make Images Mobile Responsive
+title: Torne Imagens Responsivas a dispositivos Móveis
 challengeType: 0
 forumTopicId: 18232
 dashedName: make-images-mobile-responsive
@@ -8,39 +8,39 @@ 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`.
+Primeiro, adicione uma nova imagem abaixo da existente. Defina o seu atributo `src` para `https://bit.ly/fcc-running-cats`.
 
-It would be great if this image could be exactly the width of our phone's screen.
+Seria ótimo se essa imagem pudesse ser exatamente do tamanho da nossa tela do celular.
 
-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.
+Felizmente, com Bootstrap, tudo que precisamos fazer é adicionar a classe `img-responsive` para nossa imagem. Faça isso, e a imagem deve encaixar perfeitamente na largura da sua página.
 
 # --hints--
 
-You should have a total of two images.
+Você deve ter o total de duas imagens.
 
 ```js
 assert($('img').length === 2);
 ```
 
-Your new image should be below your old one and have the class `img-responsive`.
+Sua nova imagem deve estar abaixo da sua antiga e ter a classe `img-responsive`.
 
 ```js
 assert($('img:eq(1)').hasClass('img-responsive'));
 ```
 
-Your new image should not have the class `smaller-image`.
+Sua nova imagem não deve ter a classe `smaller-image`.
 
 ```js
 assert(!$('img:eq(1)').hasClass('smaller-image'));
 ```
 
-Your new image should have a `src` of `https://bit.ly/fcc-running-cats`.
+Sua nova imagem deve ter um `src` de `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.
+Seu novo elemento `img` deve ter uma tag de fechamento.
 
 ```js
 assert(
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
index 8fcf0774c8..cdd2e7c4a0 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aeda08845
-title: Responsively Style Checkboxes
+title: Caixas de seleção Responsivas
 challengeType: 0
 forumTopicId: 18269
 required:
@@ -13,27 +13,27 @@ 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.
+Já que as classes Bootstrap `col-xs-*` são aplicáveis a todos os elementos de `form`, você também pode usá-los nas suas caixas de seleções! Dessa forma, as caixas de seleções irão estar simetricamente distribuídas pela página, independente do quão largo for a resolução da tela.
 
 # --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.
+Aninhe todos as suas três caixas de seleção em um elemento `<div class="row">`. Então aninhe cada um deles no elemento `<div class="col-xs-4">`.
 
 # --hints--
 
-All of your checkboxes should be nested inside one `div` with the class `row`.
+Todas as suas caixas de seleção devem estar aninhadas dentro de uma `div` com a classe `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`.
+Cada uma das suas caixas de seleção devem estar aninhadas dentro de sua própria `div` com a classe `col-xs-4`.
 
 ```js
 assert($('div.col-xs-4:has(input[type="checkbox"])').length > 2);
 ```
 
-All of your `div` elements should have closing tags.
+Todos os seus elementos `div` devem ter tags de fechamento.
 
 ```js
 assert(
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
index 3541d7fead..f0b14d1d22 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aedb08845
-title: Responsively Style Radio Buttons
+title: Botões Radio Responsivos
 challengeType: 0
 forumTopicId: 18270
 required:
@@ -13,27 +13,27 @@ 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.
+Você pode usar as classes `col-xs-*` do Bootstrap nos elementos do `formulário` também! Dessa forma, nossos botões radio irão estar simetricamente distribuídos pela página, independente do quão largo a resolução da nossa tela for.
 
-Nest both your radio buttons within a `<div class="row">` element. Then nest each of them within a `<div class="col-xs-6">` element.
+Aninhe ambos os seus botões radio dentro de um elemento `<div class="row">`. Em seguida aninhe cada um deles dentro de um elemento `<div class="col-xs-6">`.
 
-**Note:** As a reminder, radio buttons are `input` elements of type `radio`.
+**Nota:** Como um lembrete, botões radio são elementos `input` do tipo `radio`.
 
 # --hints--
 
-All of your radio buttons should be nested inside one `div` with the class `row`.
+Todos os seus botões radio devem estar aninhados dentro de uma `div` com a classe `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`.
+Cada um dos seus botões radio devem estar aninhados em seus próprios `div` com a classe `col-xs-6`.
 
 ```js
 assert($('div.col-xs-6:has(input[type="radio"])').length > 1);
 ```
 
-All of your `div` elements should have closing tags.
+Todos os seus elementos `div` devem ter tags de fechamento.
 
 ```js
 assert(
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
index 440c9a7740..39db57dee4 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908847
-title: Split Your Bootstrap Row
+title: Divida Sua Linha Bootstrap
 challengeType: 0
 forumTopicId: 18306
 dashedName: split-your-bootstrap-row
@@ -8,19 +8,19 @@ dashedName: split-your-bootstrap-row
 
 # --description--
 
-Now that we have a Bootstrap Row, let's split it into two columns to house our elements.
+Agora que nós temos uma linha Bootstrap, vamos dividi-la em duas colunas para hospedar nossos elementos.
 
-Create two `div` elements within your row, both with the class `col-xs-6`.
+Crie dois elementos `div` dentro da sua linha (row), ambos com a classe `col-xs-6`.
 
 # --hints--
 
-Two `div class="col-xs-6"` elements should be nested within your `div class="row"` element.
+Dois elementos `div class="col-xs-6"` devem estar aninhados dentro do seu elemento `div class="row"`.
 
 ```js
 assert($('div.row > div.col-xs-6').length > 1);
 ```
 
-All your `div` elements should have closing tags.
+Todos os seus elementos `div` devem ter tags de fechamento.
 
 ```js
 assert(
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
index 513456f26c..a9e83c533b 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed908845
-title: Style Text Inputs as Form Controls
+title: Inputs de Texto como Controles de Formulário
 challengeType: 0
 forumTopicId: 18312
 required:
@@ -13,33 +13,33 @@ 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.
+Você pode adicionar o ícone Font Awesome `fa-paper-plane` adicionando `<i class="fa fa-paper-plane"></i>` dentro do seu elemento `button` de submissão.
 
-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`.
+De ao seu campo input de texto do formulário a classe `form-control`. De ao seu botão de submissão do formulários as classes `btn btn-primary`. Também de a esse botão o ícone do Font Awesome `fa-paper-plane`.
 
-All textual `<input>`, `<textarea>`, and `<select>` elements with the class `.form-control` have a width of 100%.
+Todo texto dos elementos `<input>`, `<textarea>`, and `<select>` com a classe `.form-control` possuem largura de 100%.
 
 # --hints--
 
-The submit button in your form should have the classes `btn btn-primary`.
+O botão de submissão no seu formulário deve ter a classe `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.
+Você deve adicionar um `<i class="fa fa-paper-plane"></i>` dentro do seu elemento `button` de submissão.
 
 ```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`.
+O `input` de texto no seu formulário deve ter a classe `form-control`.
 
 ```js
 assert($('input[type="text"]').hasClass('form-control'));
 ```
 
-Each of your `i` elements should have a closing tag.
+Cada um de seus elementos `i` devem ter tags de fechamento.
 
 ```js
 assert(code.match(/<\/i>/g) && code.match(/<\/i/g).length > 3);
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
index a3e9e1b9ec..a12dc43105 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348cd8acef08811
-title: Taste the Bootstrap Button Color Rainbow
+title: Experimente o Botão Bootstrap de Cor de Arco-Íris
 challengeType: 0
 forumTopicId: 18323
 dashedName: taste-the-bootstrap-button-color-rainbow
@@ -8,27 +8,27 @@ 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.
+A classe `btn-primary` é a cor principal que você utilizará no seu app. É útil para destacar ações que você deseja que o usuário faça.
 
-Replace Bootstrap's `btn-default` class with `btn-primary` in your button.
+Substitua a classe `btn-default` do Bootstrap com `btn-primary` no seu botão.
 
-Note that this button will still need the `btn` and `btn-block` classes.
+Note que esse botão ainda precisa das classes `btn` e `btn-block`.
 
 # --hints--
 
-Your button should have the class `btn-primary`.
+Seu botão deve ter a classe `btn-primary`.
 
 ```js
 assert($('button').hasClass('btn-primary'));
 ```
 
-Your button should still have the `btn` and `btn-block` classes.
+Seu botão ainda deve ter as classes `btn` e `btn-block`.
 
 ```js
 assert($('button').hasClass('btn-block') && $('button').hasClass('btn'));
 ```
 
-All your `button` elements should have closing tags.
+Todos os seus elementos `button` devem ter tags de fechamento.
 
 ```js
 assert(
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
index b4e04ccd5b..c4bc272400 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aedf08845
-title: Use a span to Target Inline Elements
+title: Use um span para apontar a Elementos na mesma Linha
 challengeType: 0
 forumTopicId: 18370
 dashedName: use-a-span-to-target-inline-elements
@@ -8,19 +8,19 @@ 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?
+Você pode usar spans para criar elementos na mesma linha. Lembra-se quando usamos a classe `btn-block` para fazer o botão preencher toda a linha?
 
-<button class='btn' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>normal button</button>
+<button class='btn' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>botão normal</button>
 
-<button class='btn btn-block' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>btn-block button</button>
+<button class='btn btn-block' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>botão btn-block</button>
 
-That illustrates the difference between an "inline" element and a "block" element.
+Isso ilustra a diferença entre um elemento "emlinha" (inline) e um elemento de "bloco" (block).
 
-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.
+Ao usar o elemento inline `span`, você pode colocar diversos elementos na mesma linha, e até estilizar diferentes partes da mesma linha de forma diferente.
 
-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.
+Usando um elemento `span`, aninhe a palavra `love` dentro do elemento `p` que atualmente possui o texto `Things cats love`. Então de ao `span` a classe `text-danger` para tornar o texto vermelho.
 
-Here's how you would do this for the `p` element that has the text `Top 3 things cats hate`:
+Aqui está como você faria isso para o elemento `p` que possui o texto `Top 3 things cats hate`:
 
 ```html
 <p>Top 3 things cats <span class="text-danger">hate:</span></p>
@@ -28,13 +28,13 @@ Here's how you would do this for the `p` element that has the text `Top 3 things
 
 # --hints--
 
-Your `span` element should be inside your `p` element.
+Seu elemento `span` deve estar dentro do seu elemento `p`.
 
 ```js
 assert($('p span') && $('p span').length > 0);
 ```
 
-Your `span` element should have just the text `love`.
+Seu elemento `span` deve ter apenas o texto `love`.
 
 ```js
 assert(
@@ -46,13 +46,13 @@ assert(
 );
 ```
 
-Your `span` element should have class `text-danger`.
+Seu elemento `span` deve ter a classe `text-danger`.
 
 ```js
 assert($('span').hasClass('text-danger'));
 ```
 
-Your `span` element should have a closing tag.
+Seu elemento `span` deve ter uma tag de fechamento.
 
 ```js
 assert(
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
index d53b768509..f046d8160a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aec908857
-title: Use Comments to Clarify Code
+title: Use Comentários para Esclarece o Código
 challengeType: 0
 forumTopicId: 18347
 dashedName: use-comments-to-clarify-code
@@ -8,35 +8,35 @@ 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.
+Quando começarmos a usar JQuery, nós modificaremos elementos HTML sem a necessidade de realmente alterá-los no HTML.
 
-Let's make sure that everyone knows they shouldn't actually modify any of this code directly.
+Vamos ter certeza de que todo mundo sabe que eles não deveriam realmente modificar nenhum desse código diretamente.
 
-Remember that you can start a comment with `<!--` and end a comment with `-->`
+Lembre-se de que você pode iniciar um comentário com `<!--` e terminar um comentário com `-->`
 
-Add a comment at the top of your HTML that says `Code below this line should not be changed`
+Adicione um comentário no topo do seu HTML que diz `Code below this line should not be changed` (O código abaixo dessa linha não deve ser alterado)
 
 # --hints--
 
-You should start a comment with `<!--` at the top of your HTML.
+Você deve começar um comentário com `<!--` no topo do seu HTML.
 
 ```js
 assert(code.match(/^\s*<!--/));
 ```
 
-Your comment should have the text `Code below this line should not be changed`.
+Seu comentário deve ter o texto `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 `-->`.
+Você deve fechar o seu comentário com `-->`.
 
 ```js
 assert(code.match(/-->.*\n+.+/g));
 ```
 
-You should have the same number of comment openers and closers.
+Você deve ter o mesmo número de abertura e fechamento de comentários.
 
 ```js
 assert(code.match(/<!--/g).length === code.match(/-->/g).length);
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
index 3e5204468d..81013c5ac2 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9acde08712
-title: Use Responsive Design with Bootstrap Fluid Containers
+title: Use Design Responsivo com Contêineres Fluidos do Bootstrap
 challengeType: 0
 forumTopicId: 18362
 dashedName: use-responsive-design-with-bootstrap-fluid-containers
@@ -8,31 +8,31 @@ 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.
+Na seção do HTML5 e CSS do freeCodeCamp nós construímos uma aplicação de Foto de Gatos. Agora vamos voltar para isso. Dessa vez, nós estilizaremos usando o popular framework de CSS responsivo Bootstrap.
 
-Bootstrap will figure out how wide your screen is and respond by resizing your HTML elements - hence the name <dfn>responsive design</dfn>.
+O Bootstrap descobrirá o quão larga sua tela é e responderá redimensionando os seus elementos HTML - daí o nome <dfn>design responsivo</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.
+Com um design responsivo, não há necessidade de projetar uma versão móvel do seu site. Vai parecer bom em dispositivos com telas de qualquer largura.
 
-You can add Bootstrap to any app by adding the following code to the top of your HTML:
+Você pode incluir o Bootstrap em qualquer aplicativo, adicionando o seguinte código ao topo do seu 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.
+Neste caso, já o adicionamos para você a esta página por trás dos panos. Note que usar a tag `>` ou `/>` para fechar a tag `link` é aceitável.
 
-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`.
+Para começar, devemos aninhar todos os nossos HTML (exceto a tag `link` e o elemento `style`) em um elemento `div` com a classe `container-fluid`.
 
 # --hints--
 
-Your `div` element should have the class `container-fluid`.
+Seu elemento `div` deve ter a classe `container-fluid`.
 
 ```js
 assert($('div').hasClass('container-fluid'));
 ```
 
-Your `div` element should have a closing tag.
+Seu elemento `div` deve ter uma tag de fechamento.
 
 ```js
 assert(
@@ -42,7 +42,7 @@ assert(
 );
 ```
 
-All HTML elements after the closing `style` tag should be nested in `.container-fluid`.
+Todos os elementos HTML após a tag de fechamento `style` deve estar aninhado dentro de `.container-fluid`.
 
 ```js
 assert($('.container-fluid').children().length >= 8 && !$('.container-fluid').has("style").length && !$('.container-fluid').has("link").length);
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
index 17f0f4c146..93577b40e2 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad88fee1348ce8acef08815
-title: Use the Bootstrap Grid to Put Elements Side By Side
+title: Use a Grid Bootstrap para Colocar Elementos Lado a Lado
 challengeType: 0
 forumTopicId: 18371
 dashedName: use-the-bootstrap-grid-to-put-elements-side-by-side
@@ -8,33 +8,33 @@ 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 usa o sistema responsivo de grid de 12 colunas, o que torna super fácil colocar elementos em linhas e especificar cada largura relativa de um elemento. A maioria das classes Bootstrap podem ser aplicadas a um elemento `div`.
 
-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.
+Bootstrap possui diferentes atributos de largura de colunas que utiliza dependendo do quão largo for a tela do usuário. Por exemplo, celulares possuem telas estreitas, e laptops possuem telas mais largas.
 
-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.
+Tome como exemplo a classe Bootstrap `col-md-*`. Aqui, `md` significa médio, e `*` é o número especificando quantas colunas de largura o elemento deve ser. Nesse caso, a largura da coluna de um elemento em uma tela de tamanho mediano, como um laptop, está sendo especificado.
 
-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.
+No app de Foto de Gatos que estamos construindo, utilizaremos `col-xs-*`, onde `xs` significa extra pequeno (como uma tela extra pequena de um telefone móvel), e `*` é o número de colunas especificando quantas colunas de largura o elemento deve ser.
 
-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.
+Coloque os botões `Like`, `Info` e `Delete` lado a lado ao aninhar todos os três em um elemento `<div class="row">`, em seguida, cada um deles dentro de um elemento `<div class="col-xs-4">`.
 
-The `row` class is applied to a `div`, and the buttons themselves can be nested within it.
+A classe `row` é aplicada à `div`, e os próprios botões podem ser aninhados dentro dela.
 
 # --hints--
 
-Your buttons should all be nested within the same `div` element with the class `row`.
+Seu botões devem estar aninhados dentro do mesmo elemento `div` com a classe `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`.
+Cada um dos seus botões Bootstrap devem estar aninhados dentro de seu próprio elemento `div` com a classe `col-xs-4`.
 
 ```js
 assert($('div.col-xs-4:has(button)').length > 2);
 ```
 
-Each of your `button` elements should have a closing tag.
+Cada um dos seus elementos `button` devem ter uma tag de fechamento.
 
 ```js
 assert(
@@ -44,7 +44,7 @@ assert(
 );
 ```
 
-Each of your `div` elements should have a closing tag.
+Cada um dos seus elementos `div` devem ter uma tag de fechamento.
 
 ```js
 assert(
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
index 3102b61875..6d1379fc3d 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348ce8acef08814
-title: Warn Your Users of a Dangerous Action with btn-danger
+title: Avise Seus Usuários de uma Ação Perigosa com btn-danger
 challengeType: 0
 forumTopicId: 18375
 dashedName: warn-your-users-of-a-dangerous-action-with-btn-danger
@@ -8,33 +8,33 @@ 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.
+Bootstrap vem com diversas cores pré-definidas para botões. A classe `btn-danger` é a cor de botão que você usará para notificar seus usuários que o botão executa uma ação destrutiva, como deletar uma foto de gato.
 
-Create a button with the text `Delete` and give it the class `btn-danger`.
+Crie um botão com o texto `Delete` e de a ele a classe `btn-danger`.
 
-Note that these buttons still need the `btn` and `btn-block` classes.
+Note que esses botões ainda precisam das classes `btn` e `btn-block`.
 
 # --hints--
 
-You should create a new `button` element with the text `Delete`.
+Você deve criar um novo elemento `button` com o texto `Delete`.
 
 ```js
 assert(new RegExp('Delete', 'gi').test($('button').text()));
 ```
 
-All of your Bootstrap buttons should have the `btn` and `btn-block` classes.
+Todos os seus botões Bootstrap devem ter as classes `btn` e `btn-block`.
 
 ```js
 assert($('button.btn-block.btn').length > 2);
 ```
 
-Your new button should have the class `btn-danger`.
+Seu novo botão deve ter a classe `btn-danger`.
 
 ```js
 assert($('button').hasClass('btn-danger'));
 ```
 
-All of your `button` elements should have closing tags.
+Todos os seus elementos `button` devem ter tags de fechamento.
 
 ```js
 assert(
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
index cbb6d71c11..d8dfee115c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd0f
-title: Build a 25 + 5 Clock
+title: Construa um Relógio 25 + 5
 challengeType: 3
 forumTopicId: 301373
 dashedName: build-a-25--5-clock
@@ -8,71 +8,71 @@ 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>.
+**Objetivo:** Construir um app [CodePen.io](https://codepen.io) que é funcionalmente semelhante a: <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.
+Atenda às [especificações de usuário](https://en.wikipedia.org/wiki/User_story) abaixo para passar em todos os testes. Dê à página o seu próprio estilo pessoal.
 
-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!
+Você pode usar qualquer mistura de HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux e JQuery para completar este projeto. Você deve usar um framework frontend (como React por exemplo) porque essa seção trata de aprender frameworks fronted. Tecnologias adicionais não listadas acima não são recomendadas e usá-las é por sua conta e risco. Estamos olhando para apoiar outros frameworks frontend como Angular e Vue, mas eles não são atualmente suportados. Vamos aceitar e tentar corrigir todos os relatórios de problemas que usem o conjunto de tecnologias sugeridas para esse projeto. Boa programação!
 
-**User Story #1:** I can see an element with `id="break-label"` that contains a string (e.g. "Break Length").
+**User Story #1:** Eu consigo ver um elemento com `id="break-label"` que contém 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 #2:** Eu consigo ver um elemento com `id="session-label"` que contém 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 #3:** Eu consigo ver dois elementos clicáveis com os IDs correspondentes: `id="break-decrement"` e `id="session-decrement"`.
 
-**User Story #4:** I can see two clickable elements with corresponding IDs: `id="break-increment"` and `id="session-increment"`.
+**User Story #4:** Eu consigo ver dois elementos clicáveis com os IDs correspondentes: `id="break-increment"` e `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 #5:** Eu consigo ver um elemento com um id correspondente `id="break-length"`, o que por padrão (no carregamento) exibe o valor de 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 #6:** Eu consigo ver um elemento com um id correspondente `id="session-length"`, o que por padrão exibe o valor de 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 #7:** Eu consigo ver um elemento com um id correspondente `id="timer-length"`, que contém a string indicando que uma sessão foi inicializada (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 #8:** Eu consigo ver um elemento com id correspondente `id="time-left"`. NOTA: Pausado ou em execução, o valor nesse campo deve sempre ser exibido no formato `mm:ss` (i.e. 25:00).
 
-**User Story #9:** I can see a clickable element with a corresponding `id="start_stop"`.
+**User Story #9:** Eu consigo ver um elemento clicável com id correspondente `id="start_stop"`.
 
-**User Story #10:** I can see a clickable element with a corresponding `id="reset"`.
+**User Story #10:** Eu consigo ver um elemento clicável com id correspondente `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 #11:** Quando eu clico o elemento com id `reset`, qualquer temporizador em execução deve ser parado, o valor dentro de `id="break-length"` deve retornar `5`, o valor dentro de `id="session-length"` deve retornar 25, e o elemento com `id="time-left"` deve ser redefinido para o seu estado padrão.
 
-**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 #12:** Quando eu clico o elemento com o id `break-decrement`, o valor dentro de `id="break-length"` decrementa 1, e eu consigo ver o valor atualizado.
 
-**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 #13:** Quando eu clico o elemento com id `break-increment`, o valor dentro de `id="break-length"` incrementa 1, e eu consigo ver o valor atualizado.
 
-**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 #14:** Quando eu clico o elemento com id `session-decrement`, o valor dentro de `id="session-length"` decrementa 1, e eu consigo ver o valor atualizado.
 
-**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 #15:** Quando eu clico o elemento com id `session-increment`, o valor dentro de `id="session-length"` incrementa 1, e eu consigo ver o valor atualizado.
 
-**User Story #16:** I should not be able to set a session or break length to &lt;= 0.
+**User Story #16:** Eu não devo ser capaz de definir uma sessão ou quebrar o comprimento para &lt;= 0.
 
-**User Story #17:** I should not be able to set a session or break length to > 60.
+**User Story #17:** Eu não devo ser capaz de definir uma sessão ou quebrar o comprimento para > 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 #18:** Quando eu clico pela primeira vez o elemento com `id="start_stop"`, o temporizador deve começar a correr a partir do valor exibido atualmente em `id="session-length"`, mesmo se o valor foi incrementado ou decrementado do valor original 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 #19:** Se o temporizador estiver em execução, o elemento com id `time-left` deve exibir o tempo restante no formato `mm:ss` (decrementando 1 e atualizando a saída a cada 1000ms).
 
-**User Story #20:** If the timer is running and I click the element with `id="start_stop"`, the countdown should pause.
+**User Story #20:** Se o timer estiver em execução e eu clicar o elemento com `id="start_stop"`, a contagem regressiva deve pausar.
 
-**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 #21:** Se o temporizador estiver pausado e eu clicar o elemento com `id="start_stop"`, a contagem regressiva deve continuar rodando a partir do ponto no qual foi pausado.
 
-**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 #22:** Quando a contagem regressiva de sessão chegar a zero (NOTA: temporizador DEVE alcançar 00:00), e uma nova contagem regressiva iniciar, o elemento com id `timer-label` deve exibir uma string indicando que uma quebra foi iniciada.
 
-**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 #23:** Quando a contagem regressiva de sessão alcançar zero (NOTA: temporizador DEVE alcançar 00:00), uma nova contagem regressiva deve iniciar, contando regressivamente a partir do valor atualmente exibido no elemento `id="break-length"`.
 
-**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 #24:** Quando a contagem regressiva de quebra alcançar zero (NOTA: temporizador DEVE alcançar 00:00) e uma nova contagem regressiva iniciar, o elemento com o id `timer-label` deve exibir a string indicando que uma sessão foi iniciada.
 
-**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 #23:** Quando a contagem regressiva de quebra alcançar zero (NOTA: temporizador DEVE alcançar 00:00), uma nova contagem regressiva de sessão deve iniciar, contando regressivamente a partir do valor atualmente exibido no elemento `id="session-length"`.
 
-**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 #23:** Quando uma contagem regressiva alcançar zero (NOTA: temporizador DEVE alcançar 00:00), um som indicando que o tempo acabou deve ser reproduzido. Isso deve utilizar uma tag HTML5 `audio` e ter um id correspondente `id="beep"`.
 
-**User Story #27:** The audio element with `id="beep"` must be 1 second or longer.
+**User Story #27:** O elemento audio com `id="beep"` deve ter 1 segundo ou mais de duração.
 
-**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.
+**User Story #28:** O elemento audio com id `beep` deve parar de reproduzir e ser rebobinado para começar quando o elemento com o id `reset` for clicado.
 
-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`
+Você pode construir seu projeto com <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>usando este template CodePen</a> e clicando `Save` para criar seu próprio pen. Ou você pode usar esse link CDN para rodar os testes em qualquer ambiente que você goste:`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.
+Quando você terminar, envie a URL para o seu projeto em trabalho com todos os testes passando.
 
 # --solutions--
 
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
index 4cf667cf9e..529d37643c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 587d7dbc367417b2b2512bae
-title: Build a Drum Machine
+title: Construa uma Máquina de Tambor
 challengeType: 3
 forumTopicId: 301370
 dashedName: build-a-drum-machine
@@ -8,29 +8,29 @@ 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>.
+**Objetivo:** Construa um app [CodePen.io](https://codepen.io) que seja funcionalmente semelhante a: <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.
+Atenda às [especificações de usuário](https://en.wikipedia.org/wiki/User_story) abaixo para passar em todos os testes. Dê à página o seu próprio estilo pessoal.
 
-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!
+Você pode usar qualquer mistura de HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux e JQuery para completar este projeto. Você deve usar um framework frontend (como React por exemplo) porque essa seção trata de aprender frameworks fronted. Tecnologias adicionais não listadas acima não são recomendadas e usá-las é por sua conta e risco. Estamos olhando para apoiar outros frameworks frontend como Angular e Vue, mas eles não são atualmente suportados. Vamos aceitar e tentar corrigir todos os relatórios de problemas que usem o conjunto de tecnologias sugeridas para esse projeto. Boa programação!
 
-**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 #1:** Eu devo ser capaz de ver um contêiner externo com um id correspondente `id="drum-machine"` que contém todos os outros elementos.
 
-**User Story #2:** Within `#drum-machine` I can see an element with a corresponding `id="display"`.
+**User Story #2:** Dentro de `#drum-machine` eu consigo ver um elemento com um id correspondente `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 #3:** Dentro de `#drum-machine` Eu consigo ver 9 elementos tambores clicáveis, cada um com o nome de classe `drum-pad`, um id único que descreve o clipe de áudio que o tambor será definido para executar, e um texto interno que corresponde a uma das teclas do teclado a seguir: `Q`, `W`, `E`, `A`, `S`, `D`, `Z`, `X`, `C`. Os tambores DEVEM estar nesta ordem.
 
-**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 #4:** Dentro de cada `.drum-pad`, deve ter um elemento HTML5 `audio` o qual tem o atributo `src` apontando para um clipe de áudio, o nome de classe `clip`, e um id correspondendo ao texto interno do seu `.drum-pad` parente (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 #5:** Quando eu clico em um elemento `.drum-pad`, o clipe de áudio dentro do seu elemento filho `audio` deve ser ativado.
 
-**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 #6:** Quando eu pressionar a tecla de gatilho associada com cada `.drum-pad`, o clipe de áudio dentro do elemento filho `audio` deve ser ativado (e.g. pressionando a tecla `Q` deve acionar o tambor o qual contém a string `Q`, pressionando a tecla `W` deve acionar o tambor o qual contém a 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).
+**User Story #7:** Quando um `.drum-pad` é acionado, uma string descrevendo o clipe de áudio associado é exibido como o texto interno do elemento `#display` (cada string precisa ser única).
 
-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`
+Você pode construir seu projeto com <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>usando este template CodePen</a> e clicando `Save` para criar seu próprio pen. Ou você pode usar esse link CDN para rodar os testes em qualquer ambiente que você goste:`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.
+Quando você terminar, envie a URL para o seu projeto em trabalho com todos os testes passando.
 
 # --solutions--
 
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
index 7b8a3bc217..a09549fe0d 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd17
-title: Build a JavaScript Calculator
+title: Construa uma Calculadora JavaScript
 challengeType: 3
 forumTopicId: 301371
 dashedName: build-a-javascript-calculator
@@ -8,52 +8,52 @@ 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>.
+**Objetivo:** Construa um app [CodePen.io](https://codepen.io) que seja funcionalmente semelhante a: <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.
+Atenda às [especificações de usuário](https://en.wikipedia.org/wiki/User_story) abaixo para passar em todos os testes. Dê à página o seu próprio estilo pessoal.
 
-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!
+Você pode usar qualquer mistura de HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux e JQuery para completar este projeto. Você deve usar um framework frontend (como React por exemplo) porque essa seção trata de aprender frameworks fronted. Tecnologias adicionais não listadas acima não são recomendadas e usá-las é por sua conta e risco. Estamos olhando para apoiar outros frameworks frontend como Angular e Vue, mas eles não são atualmente suportados. Vamos aceitar e tentar corrigir todos os relatórios de problemas que usem o conjunto de tecnologias sugeridas para esse projeto. Boa programação!
 
-**User Story #1:** My calculator should contain a clickable element containing an `=` (equal sign) with a corresponding `id="equals"`.
+**User Story #1:** Minha calculadora deve conter um elemento clicável contendo um `=` (sinal de igualdade) com o id correspondente `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 #2:** Minha calculadora deve conter 10 elementos clicáveis contendo um número cada de 0 até 9, com os ids correspondentes a seguir: `id="zero"`, `id="one"`, `id="two"`, `id="three"`, `id="four"`, `id="five"`, `id="six"`, `id="seven"`, `id="eight"` e `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 #3:** Minha calculadora deve conter 4 elementos clicáveis cada um contendo uma das 4 operações matemáticas primárias com os ids correspondentes a seguir: `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 #4:** Minha calculadora deve conter um elemento clicável contendo o símbolo `.` (ponto decimal) com o id correspondente `id="decimal"`.
 
-**User Story #5:** My calculator should contain a clickable element with an `id="clear"`.
+**User Story #5:** Minha calculadora deve conter um elemento clicável com um `id="clear"`.
 
-**User Story #6:** My calculator should contain an element to display values with a corresponding `id="display"`.
+**User Story #6:** Minha calculadora deve conter um elemento para exibir valores com o id correspondente `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 #7:** A qualquer momento, pressionando o botão `clear` irá limpar os valores de entrada e saída, e retorna a calculadora ao seu estado inicial; 0 deve ser mostrado no elemento com o id `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 #8:** Enquanto eu coloco números de entrada, eu devo ser capaz de ver a minha entrada no elemento com id `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 #9:** Em qualquer ordem, eu devo ser capaz de adicionar, subtrair, multiplicar e dividir uma cadeia de números de qualquer tamanho, e quando eu pressionar `=`, o resultado correto deve ser mostrado no elemento com id `display`.
 
-**User Story #10:** When inputting numbers, my calculator should not allow a number to begin with multiple zeros.
+**User Story #10:** Ao inserir números, minha calculadora não deve permitir um número de começar com múltiplos 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 #11:** Quando o elemento decimal for clicado, um `.` deve ser adicionado ao valor atualmente exibido; dois `.` em um número não deve ser aceito.
 
-**User Story #12:** I should be able to perform any operation (`+`, `-`, `*`, `/`) on numbers containing decimal points.
+**User Story #12:** Eu devo ser capaz de executar qualquer operação (`+`, `-`, `*`, `/`) em números contendo pontos decimais.
 
-**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 #13:** Se 2 ou mais operadores forem inseridos consecutivamente, a operação executada deve ser o último operador inserido (excluindo o símbolo de negação (`-`)). Por exemplo, se `5 + * 7 =` for inserido, o resultado deve ser `35` (i.e. `5 * 7`); se `5 * - 5 =` for inserido, o resultado deve ser `-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 #14:** Pressionando um operador imediatamente após um `=` deve iniciar um novo cálculo que opera no resultado da avaliação anterior.
 
-**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).
+**User Story #15:** Minha calculadora deve ter diversas casas decimais de precisão ao se tratar de arredondamento (note que não há um padrão exato, mas você deve ser capaz de lidar com cálculos como `2 / 7` com precisão razoável de pelo menos 4 casas decimais).
 
-**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.
+**Nota Para a Lógica da Calculadora:** Deve-se notar que há duas principais escolas de pensamento na lógica da entrada da calculadora: <dfn>lógica da execução imediata</dfn> e <dfn>lógica da fórmula</dfn>. Nosso exemplo utiliza a lógica da fórmula e observa a ordem de precedência de operação, execução imediata não faz isso. Qualquer uma é aceitável, mas por favor note que dependendo de qual você escolher, sua calculadora pode alcançar diferentes resultados do que os nossos para certas equações (veja abaixo um exemplo). Desde que sua matemática possa ser verificada por outra calculadora em produção, por favor não considere isso um bug.
 
-**EXAMPLE:** `3 + 5 x 6 - 2 / 4 =`
+**EXEMPLO:** `3 + 5 x 6 - 2 / 4 =`
 
--   **Immediate Execution Logic:** `11.5`
--   **Formula/Expression Logic:** `32.5`
+-   **Lógica de execução imediata:** `11.5`
+-   **Lógica de Fórmula/Expressão:** `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`
+Você pode construir seu projeto com <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>usando este template CodePen</a> e clicando `Save` para criar seu próprio pen. Ou você pode usar esse link CDN para rodar os testes em qualquer ambiente que você goste:`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.
+Quando você terminar, envie a URL para o seu projeto em trabalho com todos os testes passando.
 
 # --solutions--
 
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
index 2be74eba1c..2cebad4c6f 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bd7157d8c242eddfaeb5bd13
-title: Build a Markdown Previewer
+title: Construa um Pré-Visualizador de Marcação
 challengeType: 3
 forumTopicId: 301372
 dashedName: build-a-markdown-previewer
@@ -8,29 +8,29 @@ 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>.
+**Objetivo:** Construir um app [CodePen.io](https://codepen.io) que seja funcionalmente semelhante a: <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.
+Atenda às [especificações de usuário](https://en.wikipedia.org/wiki/User_story) abaixo para passar em todos os testes. Dê à página o seu próprio estilo pessoal.
 
-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!
+Você pode usar qualquer mistura de HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux e JQuery para completar este projeto. Você deve usar um framework frontend (como React por exemplo) porque essa seção trata de aprender frameworks fronted. Tecnologias adicionais não listadas acima não são recomendadas e usá-las é por sua conta e risco. Estamos olhando para apoiar outros frameworks frontend como Angular e Vue, mas eles não são atualmente suportados. Vamos aceitar e tentar corrigir todos os relatórios de problemas que usem o conjunto de tecnologias sugeridas para esse projeto. Boa programação!
 
-**User Story #1:** I can see a `textarea` element with a corresponding `id="editor"`.
+**User Story #1:** Eu consigo ver um elemento `textarea` com o id correspondente `id="editor"`.
 
-**User Story #2:** I can see an element with a corresponding `id="preview"`.
+**User Story #2:** Eu consigo ver um elemento com o id correspondente `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 #3:** Quando eu insiro texto no elemento `#editor`, o elemento `#preview` é atualizado enquanto eu escrevo para exibir o conteúdo do 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 #4:** Quando insiro marcação do GitHub no elemento `#editor`, o texto é renderizado como HTML no elemento `#preview` enquanto eu escrevo (DICA: Você não precisa analisar a marcação você mesmo - você pode importar a biblioteca Marked para isso: <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 #5:** Quando meu pré-visualizador de marcação carregar pela primeira vez, o texto padrão no campo `#editor` deve conter uma marcação válida que representa pelo menos um de cada um dos elementos a seguir: um header (tamanho H1), um sub header (tamanho H2), um link, um código em linha, um código de bloco, uma lista de item, um blockquote, uma imagem, e um texto em negrito.
 
-**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.
+**User Story #6:** Quando meu pré-visualizador de marcação carregar pela primeira vez, a marcação padrão no campo `#editor` deve ser renderizado como HTML no elemento `#preview`.
 
-**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.
+**Bônus opcional (você não precisa fazer esse teste passar):** Meu pré-visualizador de marcação interpreta retorno de carro e os renderiza como elementos `br` (quebra de linha).
 
-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`
+Você pode construir seu projeto com <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>usando este template CodePen</a> e clicando `Save` para criar seu próprio pen. Ou você pode usar esse link CDN para rodar os testes em qualquer ambiente que você goste:`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.
+Quando você terminar, envie a URL para o seu projeto em trabalho com todos os testes passando.
 
 # --solutions--
 
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
index f70f8dab0f..c04c0438db 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd13
-title: Build a Random Quote Machine
+title: Construa uma Máquina de Citação Aleatória
 challengeType: 3
 forumTopicId: 301374
 dashedName: build-a-random-quote-machine
@@ -8,39 +8,39 @@ 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>.
+**Objetivo:** Construa um app [CodePen.io](https://codepen.io) que seja funcionalmente semelhante a: <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.
+Atenda às [especificações de usuário](https://en.wikipedia.org/wiki/User_story) abaixo para passar em todos os testes. Dê à página o seu próprio estilo pessoal.
 
-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!
+Você pode usar qualquer mistura de HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux e JQuery para completar este projeto. Você deve usar um framework frontend (como React por exemplo) porque essa seção trata de aprender frameworks fronted. Tecnologias adicionais não listadas acima não são recomendadas e usá-las é por sua conta e risco. Estamos olhando para apoiar outros frameworks frontend como Angular e Vue, mas eles não são atualmente suportados. Vamos aceitar e tentar corrigir todos os relatórios de problemas que usem o conjunto de tecnologias sugeridas para esse projeto. Boa programação!
 
-**User Story #1:** I can see a wrapper element with a corresponding `id="quote-box"`.
+**User Story #1:** Eu consigo ver um elemento de embrulho com o id correspondente `id="quote-box"`.
 
-**User Story #2:** Within `#quote-box`, I can see an element with a corresponding `id="text"`.
+**User Story #2:** Dentro de `#quote-box`, Eu consigo ver um elemento com o id correspondente `id="text"`.
 
-**User Story #3:** Within `#quote-box`, I can see an element with a corresponding `id="author"`.
+**User Story #3:** Dentro de `#quote-box`, eu consigo ver um elemento com o id correspondente `id="author"`.
 
-**User Story #4:** Within `#quote-box`, I can see a clickable element with a corresponding `id="new-quote"`.
+**User Story #4:** Dentro de `#quote-box`, eu consigo ver um elemento clicável com o id correspondente `id="new-quote"`.
 
-**User Story #5:** Within `#quote-box`, I can see a clickable `a` element with a corresponding `id="tweet-quote"`.
+**User Story #5:** Dentro de `#quote-box`, eu consigo ver um elemento clicável `a` com o id correspondente `id="tweet-quote"`.
 
-**User Story #6:** On first load, my quote machine displays a random quote in the element with `id="text"`.
+**User Story #6:** Ao carregar pela primeira vez, minha máquina de citação exibe uma citação aleatória no elemento com `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 #7:** Ao carregar pela primeira vez, minha máquina de citação exibe o autor da citação aleatória no elemento com `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 #8:** Quando o botão `#new-quote` é clicado, minha máquina de citação deve buscar uma nova citação e exibi-la no elemento `#text`.
 
-**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 #9:** Minha máquina de citação deve buscar o novo autor da citação quando o botão `#new-quote` for clicado e o exibir no elemento `#author`.
 
-**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 #10:** Eu posso tweetar a citação atual ao clicar no elemento `#tweet-quote` `a`. Esse elemento `a` deve incluir o caminho `"twitter.com/intent/tweet"` no seu atributo `href` para tweetar a citação atual.
 
-**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.
+**User Story #11:** O elemento de embrulho `#quote-box` deve ser centralizado horizontalmente. Por favor execute testes com o zoom do navegador em 100% e com a página maximizada.
 
-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`
+Você pode construir seu projeto com <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>usando este template CodePen</a> e clicando `Save` para criar seu próprio pen. Ou você pode usar esse link CDN para rodar os testes em qualquer ambiente que você goste:`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.
+Quando você terminar, envie a URL para o seu projeto em trabalho com todos os testes passando.
 
-**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.
+**Nota:** Twitter não permite que links sejam carregados em um iframe. Tente usar o atributo `target="_blank"` ou `target="_top"` no elemento `#tweet-quote` se o seu tweet não carregar. `target="_top"` irá substituir a aba atual para garantir que o seu trabalho foi salvo.
 
 # --solutions--
 
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
index 50960b60c6..9eaf3cc52c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: 564944c91be2204b269d51e3
-title: Change Text Inside an Element Using jQuery
+title: Altere Texto Dentro de um Elemento Usando JQuery
 challengeType: 6
 forumTopicId: 16773
 dashedName: change-text-inside-an-element-using-jquery
@@ -8,27 +8,27 @@ 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.
+Usando JQuery, você pode alterar o texto entre as tags de abertura e fechamento de um elemento. Você pode alterar até a marcação HTML.
 
-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.
+jQuery possui uma função chamada `.html()` que permite a você adicionar tags HTML e texto dentro de um elemento. Qualquer conteúdo previamente dentro do elemento será completamente substituído com o conteúdo que você forneceu usando essa função.
 
-Here's how you would rewrite and emphasize the text of our heading:
+Aqui está como você rescreveria e enfatizaria o texto do nosso cabeçalho:
 
 ```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.
+JQuery também possui uma função similar chamada `.text()` que altera apenas texto sem adicionar tags. Em outras palavras, essa função não irá avaliar nenhuma tag HTML passada a ela, mas ao invés disso irá tratá-la como o texto que você quer substituir o conteúdo atual existente.
 
-Change the button with id `target4` by emphasizing its text.
+Modifique o botão com id `target4` enfatizando seu texto.
 
-[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.
+[Veja nosso artigo de notícias para &lt;em>](https://www.freecodecamp.org/news/html-elements-explained-what-are-html-tags/#em-element) aprender a diferença entre `<i>` e `<em>` e seus usos.
 
-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.
+Note que enquanto a tag `<i>` foi tradicionalmente usada para enfatizar texto, foi adotada desde então para uso como tag para ícones. A tag `<em>` é agora amplamente aceita como a tag para ênfase. Ambos funcionarão para esse desafio.
 
 # --hints--
 
-You should emphasize the text in your `target4` button by adding HTML tags.
+Você deve enfatizar o texto no seu botão `target4` ao adicionar tags HTML.
 
 ```js
 assert.isTrue(
@@ -36,25 +36,25 @@ assert.isTrue(
 );
 ```
 
-The text should otherwise remain unchanged.
+De outro modo, o texto deve permanecer inalterado.
 
 ```js
 assert($('#target4') && $('#target4').text().trim() === '#target4');
 ```
 
-You should not alter any other text.
+Você não deve alterar nenhum outro texto.
 
 ```js
 assert.isFalse(/<em>|<i>/gi.test($('h3').html()));
 ```
 
-You should be using `.html()` and not `.text()`.
+Você deve estar usando `.html()` e não `.text()`.
 
 ```js
 assert(code.match(/\.html\(/g));
 ```
 
-You should select `button id="target4"` with jQuery.
+Você deve selecionar `button id="target4"` com jQuery.
 
 ```js
 assert(code.match(/\$\(\s*?(\"|\')#target4(\"|\')\s*?\)\.html\(/));
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
index 1e999e8ba1..e28539f579 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed908826
-title: Change the CSS of an Element Using jQuery
+title: Altere o CSS de um Elemento Usando JQuery
 challengeType: 6
 forumTopicId: 16776
 required:
@@ -11,31 +11,31 @@ dashedName: change-the-css-of-an-element-using-jquery
 
 # --description--
 
-We can also change the CSS of an HTML element directly with jQuery.
+Nós podemos também alterar o CSS de um elemento HTML diretamente com JQuery.
 
-jQuery has a function called `.css()` that allows you to change the CSS of an element.
+JQuery possui uma função chamada `.css()` que o permite alterar o CSS de um elemento.
 
-Here's how we would change its color to blue:
+Aqui está como mudaríamos sua cor para azul:
 
 ```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.
+Isso é vagarosamente diferente de uma declaração normal de CSS, porque a propriedade CSS e o seu valor estão entre aspas e separada com vírgula ao invés de ponto e vírgula.
 
-Delete your jQuery selectors, leaving an empty `document ready function`.
+Remova seus seletores JQuery, deixando um `$(document).ready(function()` vazio.
 
-Select `target1` and change its color to red.
+Selecione `target1` e altere sua cor para vermelho.
 
 # --hints--
 
-Your `target1` element should have red text.
+Seu elemento `target1` deve ter o texto vermelho.
 
 ```js
 assert($('#target1').css('color') === 'rgb(255, 0, 0)');
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas JQuery para adicionar essas classes ao elemento.
 
 ```js
 assert(!code.match(/class.*animated/g));
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
index 9bb02186d5..3a66919762 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed508826
-title: Clone an Element Using jQuery
+title: Clone um Elemento Usando JQuery
 challengeType: 6
 forumTopicId: 16780
 dashedName: clone-an-element-using-jquery
@@ -8,35 +8,35 @@ dashedName: clone-an-element-using-jquery
 
 # --description--
 
-In addition to moving elements, you can also copy them from one place to another.
+Além de mover elementos, você também pode copiá-los de um lugar para outro.
 
-jQuery has a function called `clone()` that makes a copy of an element.
+JQuery possui uma função chamada `clone()` que faz uma cópia de um elemento.
 
-For example, if we wanted to copy `target2` from our `left-well` to our `right-well`, we would use:
+Por exemplo, se quiséssemos copiar `target2` do nosso `left-well` para nosso `right-well`, usaríamos:
 
 ```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.
+Você percebeu que isso envolve colocar duas funções JQuery juntas? Isso é chamado de <dfn>function chaining</dfn> e é uma forma conveniente para fazer coisas com JQuery.
 
-Clone your `target5` element and append it to your `left-well`.
+Clone seu elemento `target5` e adicione-o ao seu `left-well`.
 
 # --hints--
 
-Your `target5` element should be inside your `right-well`.
+Seu elemento `target5` deve estar dentro do seu `right-well`.
 
 ```js
 assert($('#right-well').children('#target5').length > 0);
 ```
 
-A copy of your `target5` element should also be inside your `left-well`.
+Uma cópia do seu elemento `target5` também deve estar dentro do seu `left-well`.
 
 ```js
 assert($('#left-well').children('#target5').length > 0);
 ```
 
-You should only use jQuery to move these elements.
+Você deve usar apenas JQuery para mover esses elementos.
 
 ```js
 assert(!code.match(/class.*animated/g));
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
index 331b225990..778a645d69 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aeda08726
-title: Delete Your jQuery Functions
+title: Exclua Suas Funções jQuery
 challengeType: 6
 forumTopicId: 17561
 required:
@@ -11,37 +11,37 @@ dashedName: delete-your-jquery-functions
 
 # --description--
 
-These animations were cool at first, but now they're getting kind of distracting.
+Esses animações eram legais no início, mas agora elas estão causando distração.
 
-Delete all three of these jQuery functions from your `document ready function`, but leave your `document ready function` itself intact.
+Remova todas as três funções jQuery do seu `$(document).ready(function()`, mas deixe seu `document ready function` intacto.
 
 # --hints--
 
-All three of your jQuery functions should be deleted from your `document ready function`.
+Todas as suas três funções jQuery devem ser excluídas do seu `document ready function`.
 
 ```js
 assert(code.match(/\{\s*\}\);/g));
 ```
 
-You should leave your `script` element intact.
+Você deve deixar seu elemento `script` intacto.
 
 ```js
 assert(code.match(/<script>/g));
 ```
 
-You should leave your `$(document).ready(function() {` at the beginning of your `script` element.
+Você deve deixar o seu `$(document).ready(function() {` no início do seu elemento `script`.
 
 ```js
 assert(code.match(/\$\(document\)\.ready\(function\(\)\s?\{/g));
 ```
 
-You should leave the `document.ready` function's closing `})` intact.
+Você deve deixar intacto o fechamento `});` da função `document.ready`.
 
 ```js
 assert(code.match(/.*\s*\}\);/g));
 ```
 
-You should leave your `script` element closing tag intact.
+Você deve deixar a tag de fechamento do elemento `script` intacto.
 
 ```js
 assert(
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
index 07162e70b8..f79eebe7ba 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed808826
-title: Disable an Element Using jQuery
+title: Desativar um Elemento Usando jQuery
 challengeType: 6
 forumTopicId: 17563
 dashedName: disable-an-element-using-jquery
@@ -8,23 +8,23 @@ 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.
+Você também pode alterar as propriedades não CSS de elementos HTML com jQuery. Por exemplo, você pode desabilitar botões.
 
-When you disable a button, it will become grayed-out and can no longer be clicked.
+Quando você desativa um botão, ele se tornará cinza e não poderá mais ser clicado.
 
-jQuery has a function called `.prop()` that allows you to adjust the properties of elements.
+jQuery possui uma função chamada `.prop()` que o permite ajustar as propriedades de elementos.
 
-Here's how you would disable all buttons:
+Aqui está como você desabilitaria todos os botões:
 
 ```js
 $("button").prop("disabled", true);
 ```
 
-Disable only the `target1` button.
+Desative apenas o botão `target1`.
 
 # --hints--
 
-Your `target1` button should be disabled.
+Seu botão `target1` deve ser desativado.
 
 ```js
 assert(
@@ -34,13 +34,13 @@ assert(
 );
 ```
 
-No other buttons should be disabled.
+Nenhum outro botão deve ser desativado.
 
 ```js
 assert($('#target2') && !$('#target2').prop('disabled'));
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas jQuery para adicionar essas classes ao elemento.
 
 ```js
 assert(!code.match(/disabled[^<]*>/g));
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
index 3835dfeca8..e59d61e50f 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9acdd08826
-title: Learn How Script Tags and Document Ready Work
+title: Aprenda Como as Tags de Script e Document Ready Funcionam
 challengeType: 6
 forumTopicId: 18224
 dashedName: learn-how-script-tags-and-document-ready-work
@@ -8,23 +8,23 @@ 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.
+Agora nós estamos prontos para aprender jQuery, a ferramenta mais popular de JavaScript de todos os tempos.
 
-Before we can start using jQuery, we need to add some things to our HTML.
+Antes que nós possamos começar usando jQuery, nós precisamos adicionar algumas coisas ao nosso HTML.
 
-First, add a `script` element at the top of your page. Be sure to close it on the following line.
+Primeiro, adicione um elemento `script` no topo da sua página. Certifique-se de fechá-la na próxima linha.
 
-Your browser will run any JavaScript inside a `script` element, including jQuery.
+Seu navegar irá rodar qualquer JavaScript dentro do elemento `script`, incluindo 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: `});`
+Dentro do seu elemento `script`, adicione esse código: `$(document).ready(function() {` ao seu `script`. Em seguida, feche-o na próxima linha (ainda dentro do elemento `script`) com: `});`
 
-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.
+Aprenderemos mais sobre `functions` depois. O importante a saber é que o código que você colocar dentro de `function` executará assim que o seu navegador carregar a página.
 
-This is important because without your `document ready function`, your code may run before your HTML is rendered, which would cause bugs.
+Isso é importante porque sem o `$(document).ready(function() {`, seu código pode executar antes do HTML ser carregado, o que causaria bugs.
 
 # --hints--
 
-You should create a `script` element making sure it is valid and has a closing tag.
+Você deve criar um elemento `script` certificando-se que é válido e possui tag de fechamento.
 
 ```js
 assert(
@@ -39,7 +39,7 @@ assert(
 );
 ```
 
-You should add `$(document).ready(function() {` to the beginning of your `script` element.
+Você deve adicionar `$(document).ready(function() {` ao início do seu eleemento `script`.
 
 ```js
 assert(
@@ -49,7 +49,7 @@ assert(
 );
 ```
 
-You should close your `$(document).ready(function() {` function with `});`
+Você deve fechar sua função `$(document).ready(function() {` com `});`
 
 ```js
 assert(code.match(/\n*?\s*?\}\s*?\);/g));
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
index 94c5908436..fe0d1dd30f 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed708826
-title: Remove an Element Using jQuery
+title: Remova um Elemento Usando jQuery
 challengeType: 6
 forumTopicId: 18262
 dashedName: remove-an-element-using-jquery
@@ -8,15 +8,15 @@ dashedName: remove-an-element-using-jquery
 
 # --description--
 
-Now let's remove an HTML element from your page using jQuery.
+Agora vamos remover um elemento HTML da sua página usando jQuery.
 
-jQuery has a function called `.remove()` that will remove an HTML element entirely
+jQuery possui uma função chamada `.remove()` que irá remover completamente um elemento HTML
 
-Remove the `#target4` element from the page by using the `.remove()` function.
+Remova o elemento `#target4` da sua página usando a função `.remove()`.
 
 # --hints--
 
-You should use jQuery to remove your `target4` element from your page.
+Você deve usar jQuery para remover seu elemento `target4` da sua página.
 
 ```js
 assert(
@@ -24,7 +24,7 @@ assert(
 );
 ```
 
-You should only use jQuery to remove this element.
+Você deve usar apenas jQuery para remover esse elemento.
 
 ```js
 assert(
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
index a63b5882c7..1dc9749ecc 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed918626
-title: Remove Classes from an Element with jQuery
+title: Remova Classes de um Elemento com jQuery
 challengeType: 6
 forumTopicId: 18264
 required:
@@ -11,31 +11,31 @@ 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.
+Da mesma forma que você pode adicionar classes a um elemento com a função `addClass()` do jQuery, você pode removê-los usando a função `removeClass()` do jQuery.
 
-Here's how you would do this for a specific button:
+Aqui está como você iria fazer isso para um botão específico:
 
 ```js
 $("#target2").removeClass("btn-default");
 ```
 
-Let's remove the `btn-default` class from all of our `button` elements.
+Vamos remover a classe `btn-default` de todos os seus elementos `button`.
 
 # --hints--
 
-The `btn-default` class should be removed from all of your `button` elements.
+A classe `btn-default` deve ser removida de todos os seus elementos `button`.
 
 ```js
 assert($('.btn-default').length === 0);
 ```
 
-You should only use jQuery to remove this class from the element.
+Você deve usar apenas jQuery para remover essa classe do elemento.
 
 ```js
 assert(code.match(/btn btn-default/g));
 ```
 
-You should only remove the `btn-default` class.
+Você deve remover apenas a classe `btn-default`.
 
 ```js
 assert(
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
index 12934f268b..20eca9e05a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed108826
-title: Target a Specific Child of an Element Using jQuery
+title: Mire um Filho Específico de um Elemento Usando jQuery
 challengeType: 6
 forumTopicId: 18315
 required:
@@ -11,23 +11,23 @@ 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.
+Você já viu o porque os atributos id são tão convenientes para mirar com seletores jQuery. Mas você nem sempre terá ids legais para trabalhar.
 
-Fortunately, jQuery has some other tricks for targeting the right elements.
+Felizmente, jQuery possui outros truques para apontar para os elementos certos.
 
-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.
+jQuery usa Seletores CSS para apontar elementos. O seletor CSS `target:nth-child(n)` o permite selecionar todos os elementos nth com a classe ou tipo de elemento alvos.
 
-Here's how you would give the third element in each well the bounce class:
+Aqui está como você daria ao terceiro elemento em cada well a classe bounce:
 
 ```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.
+Faça o segundo filho em cada um dos seus elementos well quicar. Você deve selecionar os filhos do elemento com a classe `alvo`.
 
 # --hints--
 
-The second element in your `target` elements should bounce.
+O segundo elemento nos seus elementos `alvo` deve quicar.
 
 ```js
 assert(
@@ -36,19 +36,19 @@ assert(
 );
 ```
 
-Only two elements should bounce.
+Apenas dois elementos devem quicar.
 
 ```js
 assert($('.animated.bounce').length === 2);
 ```
 
-You should use the `:nth-child()` selector to modify these elements.
+Você deve usar o seletor `:nth-child()` para modificar esses elementos.
 
 ```js
 assert(code.match(/\:nth-child\(/g));
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas jQuery para adicionar essas classes ao elemento.
 
 ```js
 assert(
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
index dfd7a970d3..1b0817e4b2 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aedc08826
-title: Target Elements by Class Using jQuery
+title: Elementos Alvo por Classe Usando jQuery
 challengeType: 6
 forumTopicId: 18316
 required:
@@ -11,17 +11,17 @@ 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");`.
+Você vê como fizemos todos os seus elementos `button` quicar? Nós os selecionamos com `$("button")`, em seguida adicionamos algumas classes CSS a eles com `.addClass("animated bounce");`.
 
-You just used jQuery's `.addClass()` function, which allows you to add classes to elements.
+Você acabou de usar a função `.addClass()` do jQuery, a qual o permite adicionar classes a elementos.
 
-First, let's target your `div` elements with the class `well` by using the `$(".well")` selector.
+Primeiro, vamos ter como alvo seus elementos `div` com a classe `well` usando o seletor `$(".well")`.
 
-Note that, just like with CSS declarations, you type a `.` before the class's name.
+Observe que, assim como com declarações CSS, você digita um `.` antes do nome da classe.
 
-Then use jQuery's `.addClass()` function to add the classes `animated` and `shake`.
+Em seguida, use a função `.addClass()` do jQuery para adicionar as classes `animated<code> e <code>shake`.
 
-For example, you could make all the elements with the class `text-primary` shake by adding the following to your `document ready function`:
+Por exemplo, você poderia fazer todos os elementos com a classe `text-primary` sacudir adicionando o seguinte ao seu `$(document).ready(function() {`:
 
 ```js
 $(".text-primary").addClass("animated shake");
@@ -29,13 +29,13 @@ $(".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`.
+Você deve usar a função `addClass()` do jQuery para dar as classes `animated` e `shake` para todos os seus elementos com a classe `well`.
 
 ```js
 assert($('.well').hasClass('animated') && $('.well').hasClass('shake'));
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas jQuery para adicionar essas classes ao elemento.
 
 ```js
 assert(!code.match(/class\.\*animated/g));
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
index 085c1552a0..aad90eedb5 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aeda08826
-title: Target Elements by id Using jQuery
+title: Elementos Alvo por id Usando jQuery
 challengeType: 6
 forumTopicId: 18317
 required:
@@ -11,15 +11,15 @@ dashedName: target-elements-by-id-using-jquery
 
 # --description--
 
-You can also target elements by their id attributes.
+Você também pode mirar elementos por seus atributos id.
 
-First target your `button` element with the id `target3` by using the `$("#target3")` selector.
+Primeiro, vamos tomar como alvo seu elemento `button` com o id `target3` usando o seletor `$("#target3")`.
 
-Note that, just like with CSS declarations, you type a `#` before the id's name.
+Note que, assim como as declarações CSS, você digita um `#` antes do nome do id.
 
-Then use jQuery's `.addClass()` function to add the classes `animated` and `fadeOut`.
+Em seguida use a função `.addClass` do jQuery para adicionar as classes `animated` e `fadeOut`.
 
-Here's how you'd make the `button` element with the id `target6` fade out:
+Aqui está como você faria o elemento `button` com o id `target6` desaparecer:
 
 ```js
 $("#target6").addClass("animated fadeOut");
@@ -27,13 +27,13 @@ $("#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`.
+Você deve selecionar o elemento `button` com o `id` `target3` e usar a função `addClass()` do jQuery para dar ao botão a classe `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`.
+Você deve mirar o elemento com o id `target3` e usar a função `addClass()` do jQuery para dar a ele a classe `fadeOut`.
 
 ```js
 assert(
@@ -42,7 +42,7 @@ assert(
 );
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas jQuery para adicionar essas classes ao elemento.
 
 ```js
 assert(!code.match(/class.*animated/g));
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
index a6c8b20ddd..b4a3f44bc1 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed008826
-title: Target Even Elements Using jQuery
+title: Mire Elementos Pares Usando jQuery
 challengeType: 6
 forumTopicId: 18318
 required:
@@ -11,21 +11,21 @@ dashedName: target-even-elements-using-jquery
 
 # --description--
 
-You can also target elements based on their positions using `:odd` or `:even` selectors.
+Você também pode ter como alvo elementos baseados em suas posições usando os seletores `:odd` ou `:even`.
 
-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.
+Note que jQuery é indexado a zero, o que significa que o primeiro elemento em uma seleção tem a posição 0. Isso pode ser um pouco confuso, pois, contra-intuitivamente, `:odd` seleciona o segundo elemento (position1), fourth element (position 3) e assim por diante.
 
-Here's how you would target all the odd elements with class `target` and give them classes:
+Aqui está como você iria ter como alvo todos os elementos ímpares com a classe `target` e dar a eles as 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.
+Tente selecionar todos os elementos `alvo` pares e dar a eles as classes `animated` e `shake`. Lembre-se que **even** refere-se a posição de elementos com base em um sistema indexado a zero.
 
 # --hints--
 
-All of the `target` elements that jQuery considers to be even should shake.
+Todos os elementos `alvo` que o jQuery considerar como par devem sacudir.
 
 ```js
 assert(
@@ -33,13 +33,13 @@ assert(
 );
 ```
 
-You should use the `:even` selector to modify these elements.
+Você deve usar o seletor `:even` para modificar esses elementos.
 
 ```js
 assert(code.match(/\:even/g));
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas jQuery para adicionar essas classes ao elemento.
 
 ```js
 assert(
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
index e63103ff7b..4efb11d929 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9bedc08826
-title: Target HTML Elements with Selectors Using jQuery
+title: Elementos HTML Alvo com Seletores Usando jQuery
 challengeType: 6
 forumTopicId: 18319
 required:
@@ -11,35 +11,35 @@ dashedName: target-html-elements-with-selectors-using-jquery
 
 # --description--
 
-Now we have a `document ready function`.
+Agora temos um `$(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.
+Agora vamos escrever nossa primeira declaração jQuery. Todas as funções do jQuery começam com um `$`, geralmente são referidas como um operador de sinal de dólar ou como bling.
 
-jQuery often selects an HTML element with a <dfn>selector</dfn>, then does something to that element.
+jQuery geralmente selecionar um elemento HTML com um <dfn>selector</dfn>, em seguida faz algo a esse elemento.
 
-For example, let's make all of your `button` elements bounce. Just add this code inside your document ready function:
+Por exemplo, vamos fazer todos os nossos elementos `button` quicar. Basta adicionar esse código dentro da sua função `$(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.
+Note que nós já incluímos ambas as bibliotecas jQuery e Animate.css por trás dos panos para que você possa utilizá-las no editor.  Então você está usando jQuery para aplicar a classe `bounce` do Animate.css ao seus elementos `button`.
 
 # --hints--
 
-You should use the jQuery `addClass()` function to give the classes `animated` and `bounce` to your `button` elements.
+Você deve usar a função `addClass()` do jQuery para dar as classes `animated` e `bounce` ao seus elementos `button`.
 
 ```js
 assert($('button').hasClass('animated') && $('button').hasClass('bounce'));
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas jQuery para adicionar essas classes ao elemento.
 
 ```js
 assert(!code.match(/class.*animated/g));
 ```
 
-Your jQuery code should be within the `$(document).ready();` function.
+Seu código jQuery deve estar dentro da função `$(document).ready()`.
 
 ```js
 assert(
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
index 5b75dd072b..18815635ce 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed208826
-title: Target the Children of an Element Using jQuery
+title: Mire o Filho de um Elemento Usando jQuery
 challengeType: 6
 forumTopicId: 18320
 dashedName: target-the-children-of-an-element-using-jquery
@@ -8,11 +8,11 @@ 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.
+Quando elementos HTML são colocadas um nível abaixo de outro eles são chamados <dfn>children(filhos)</dfn> daquele elemento. Por exemplo, os elementos button nesse desafio com o texto `#target1`, `#target2` e `#target3` são todos filhos do elemento `<div class="well" id="left-well">`.
 
-jQuery has a function called `children()` that allows you to access the children of whichever element you've selected.
+jQuery possui uma função chamada `children()` que o permite acessar os filhos de qualquer elementos que você selecionou.
 
-Here's an example of how you would use the `children()` function to give the children of your `left-well` element the color `blue`:
+Aqui está um exemplo de como você usaria a função `children()` para dar ao filho do seu elemento `left-well` a cor `blue`:
 
 ```js
 $("#left-well").children().css("color", "blue")
@@ -20,23 +20,23 @@ $("#left-well").children().css("color", "blue")
 
 # --instructions--
 
-Give all the children of your `right-well` element the color orange.
+Dê a todos os filhos do seu elemento `right-well` a cor laranja.
 
 # --hints--
 
-All children of `#right-well` should have orange text.
+Todos os filhos de `#right-well` devem ter o texto laranja.
 
 ```js
 assert($('#right-well').children().css('color') === 'rgb(255, 165, 0)');
 ```
 
-You should use the `children()` function to modify these elements.
+Você deve usar a função `children()` para modificar esses elementos.
 
 ```js
 assert(code.match(/\.children\(\)\.css/g));
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas jQuery para adicionar essas classes ao elemento.
 
 ```js
 assert(code.match(/<div class="well" id="right-well">/g));
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
index 48985e399e..623365639a 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed308826
-title: Target the Parent of an Element Using jQuery
+title: Mire o Filho de um Elemento Usando jQuery
 challengeType: 6
 forumTopicId: 18321
 dashedName: target-the-parent-of-an-element-using-jquery
@@ -8,23 +8,23 @@ dashedName: target-the-parent-of-an-element-using-jquery
 
 # --description--
 
-Every HTML element has a `parent` element from which it `inherits` properties.
+Todo elemento HTML possui um elemento `parent` do qual `inherits (herda)` propriedades.
 
-For example, your `jQuery Playground` `h3` element has the parent element of `<div class="container-fluid">`, which itself has the parent `body`.
+Por exemplo, seu elemento `jQuery Playground` `h3` tem o elemento parente de `<div class="container-fluid">`, o qual ele mesmo possui o parente `body`.
 
-jQuery has a function called `parent()` that allows you to access the parent of whichever element you've selected.
+jQuery possui uma função chamada `parent()` que o permite acessar o parente de qualquer elemento que você selecionou.
 
-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:
+Aqui está um exemplo de como você usaria a função `parent()` se você quisesse dar ao elemento parente do elemento `left-well` uma cor de fundo azul:
 
 ```js
 $("#left-well").parent().css("background-color", "blue")
 ```
 
-Give the parent of the `#target1` element a background-color of red.
+Dê ao parente do elemento `#target1` uma cor de fundo (background-color) vermelha.
 
 # --hints--
 
-Your `left-well` element should have a red background.
+Seu elemento `left-well` deve ter um fundo vermelho.
 
 ```js
 assert(
@@ -35,13 +35,13 @@ assert(
 );
 ```
 
-You should use the `.parent()` function to modify this element.
+Você deve usar a função `.parent()` para modificar esse elemento.
 
 ```js
 assert(code.match(/\.parent\s*\(\s*\)\s*\.css/g));
 ```
 
-The `.parent()` method should be called on the `#target1` element.
+O método `.parent()` deve ser chamado no elemento `#target1`.
 
 ```js
 assert(
@@ -49,7 +49,7 @@ assert(
 );
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas jQuery para adicionar essas classes ao elemento.
 
 ```js
 assert(code.match(/<div class="well" id="left-well">/g));
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
index 3ab02d8057..f5f3490856 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed908626
-title: Target the Same Element with Multiple jQuery Selectors
+title: Mire o Mesmo Elemento com Múltiplos Seletores jQuery
 challengeType: 6
 forumTopicId: 18322
 required:
@@ -11,41 +11,41 @@ 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")`.
+Agora você sabe três formas de mirar elementos: pelo tipo`$("button")`, pela classe: `$(".btn")`, e pelo 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*.
+Embora seja possível adicionar várias classes em uma única chamada `.addClass()`, vamos adicioná-los ao mesmo elemento de *três formas separadas*.
 
-Using `.addClass()`, add only one class at a time to the same element, three different ways:
+Usando `.addClass()`, adicione apenas uma classe de cada vez ao mesmo elemento, três formas diferentes:
 
-Add the `animated` class to all elements with type `button`.
+Adicione a classe `animated` a todos os elementos do tipo `button`.
 
-Add the `shake` class to all the buttons with class `.btn`.
+Adicione a classe `shake` a todos os botões com classe `.btn`.
 
-Add the `btn-primary` class to the button with id `#target1`.
+Adicione a classe `btn-primary` ao botão com 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`.
+**Nota:** Você deve estar mirando apenas um elemento e adicionando apenas uma classe de cada vez. Ao todo, seus três seletores individuais acabarão adicionando as três classes `shake`, `animated` e `btn-primary` para `#target1`.
 
 # --hints--
 
-Your code should use the `$("button")` selector.
+Seu código deve usar o seletor `$("button")`.
 
 ```js
 assert(code.match(/\$\s*?\(\s*?(?:'|")\s*?button\s*?(?:'|")/gi));
 ```
 
-Your code should use the `$(".btn")` selector.
+Seu código deve usar o seletor `$(".btn")`.
 
 ```js
 assert(code.match(/\$\s*?\(\s*?(?:'|")\s*?\.btn\s*?(?:'|")/gi));
 ```
 
-Your code should use the `$("#target1")` selector.
+Seu código deve usar o seletor `$("#target1")`.
 
 ```js
 assert(code.match(/\$\s*?\(\s*?(?:'|")\s*?#target1\s*?(?:'|")/gi));
 ```
 
-You should only add one class with each of your three selectors.
+Você deve adicionar apenas uma classe com cada um dos seus três seletores.
 
 ```js
 assert(
@@ -54,7 +54,7 @@ assert(
 );
 ```
 
-Your `#target1` element should have the classes `animated`‚ `shake` and `btn-primary`.
+Seu elemento `#target1` deve ter as classes `animated`‚ `shake` e `btn-primary`.
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-You should only use jQuery to add these classes to the element.
+Você deve usar apenas jQuery para adicionar esses elementos ao elemento.
 
 ```js
 assert(!code.match(/class.*animated/g));
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
index 5b0f8ef1fe..4344769f7c 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aed608826
-title: Use appendTo to Move Elements with jQuery
+title: Use appendTo para Mover Elementos com jQuery
 challengeType: 6
 forumTopicId: 18340
 dashedName: use-appendto-to-move-elements-with-jquery
@@ -8,33 +8,33 @@ dashedName: use-appendto-to-move-elements-with-jquery
 
 # --description--
 
-Now let's try moving elements from one `div` to another.
+Agora vamos tentar mover elementos de uma `div` para outra.
 
-jQuery has a function called `appendTo()` that allows you to select HTML elements and append them to another element.
+jQuery possui uma função chamada `appendTo()` que o permite selecionar elementos HTML e adicioná-los a outro elemento.
 
-For example, if we wanted to move `target4` from our right well to our left well, we would use:
+Por exemplo, se quiséssemos mover `target4` do nosso well da direita para o da esquerda, usaríamos:
 
 ```js
 $("#target4").appendTo("#left-well");
 ```
 
-Move your `target2` element from your `left-well` to your `right-well`.
+Mova seu elemento `target2` do seu `left-well` para o seu `right-well`.
 
 # --hints--
 
-Your `target2` element should not be inside your `left-well`.
+Seu elemento `target2` não deve estar dentro do seu `left-well`.
 
 ```js
 assert($('#left-well').children('#target2').length === 0);
 ```
 
-Your `target2` element should be inside your `right-well`.
+Seu elemento `target2` deve estar dentro do seu `right-well`.
 
 ```js
 assert($('#right-well').children('#target2').length > 0);
 ```
 
-You should only use jQuery to move these elements.
+Você deve usar apenas jQuery para mover esses elementos.
 
 ```js
 assert(!code.match(/class.*animated/g));
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
index 540607dfe7..c400f8da38 100644
--- 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
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aecb08826
-title: Use jQuery to Modify the Entire Page
+title: Use jQuery para Modificar a Página Inteira
 challengeType: 6
 forumTopicId: 18361
 required:
@@ -11,17 +11,17 @@ dashedName: use-jquery-to-modify-the-entire-page
 
 # --description--
 
-We're done playing with our jQuery playground. Let's tear it down!
+Terminamos de brincar com nosso jQuery playground. Vamos despedaçar isso!
 
-jQuery can target the `body` element as well.
+jQuery também pode tomar como alvo o elemento `body`.
 
-Here's how we would make the entire body fade out: `$("body").addClass("animated fadeOut");`
+Aqui está como você faria para desaparecer todo o body:`$("body").addClass("animated fadeOut");`
 
-But let's do something more dramatic. Add the classes `animated` and `hinge` to your `body` element.
+Mas vamos fazer algo mais dramático. Adicione as classes `animated` e `hinge` ao seu elemento `body`.
 
 # --hints--
 
-You should add the classes `animated` and `hinge` to your `body` element.
+Você deve adicionar as classes `animated` e `hinge` ao seu elemento `body`.
 
 ```js
 assert($('body').hasClass('animated') && $('body').hasClass('hinge'));